| [1] | X. Yu, K. Tang, and X. Yao. Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate. Science in China Series F - Information Sciences, 53:1-11, 2010. [ bib ] |
| [2] | T. T. Nguyen and X. Yao. Benchmarking and solving dynamic constrained problems. In Proceedings of the IEEE Congress on Evolutionary Computation CEC2009, pages 690-697. IEEE Press, May 2009. [ bib ] |
| [3] | H. K. Singh, A. Isaacs, T. T. Nguyen, T. Ray, and X. Yao. Performance of infeasibility driven evolutionary algorithm (idea) on constrained dynamic single objective optimization problems. In Proceedings of the IEEE Congress on Evolutionary Computation CEC2009, pages 3127-3134, Trondheim, Norway,, May 2009. IEEE Press. [ bib ] |
| [4] | Y. Mei, K. Tang, and X. Yao. A global repair operator for capacitated arc routing problem. IEEE Transactions on System, Man and Cybernetics - Part B: Cybernetics, 39(3):723-734, 2009. [ bib ] |
| [5] | Y. Mei, K. Tang, and X. Yao. Improved memetic algorithm for capacitated arc routing problem. In Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pages 1699-1706, 2009. [ bib ] |
| [6] | T. T. Nguyen and Xin Yao. Dynamic time-linkage problem revisited. In M. Giacobini, P. Machado, A. Brabazon, J. McCormack, et al., editors, Proceedings of the 2009 European Workshops on Applications of Evolutionary Computation, EvoWorkshops 2009, volume 5484 of Lecture Notes in Computer Science, pages 735-744, 2009. [ bib ] |
| [7] | P. Rohlfshagen, P. K. Lehre, and X. Yao. Dynamic evolutionary optimisation: An analysis of frequency and magnitude of change. In Proceedings of the 2009 Genetic and Evolutionary Computation Conference, pages 1713-1720, 2009. [ bib ] |
| [8] | P. Rohlfshagen and X. Yao. The dynamic knapsack problem revisited: A new benchmark problem for dynamic combinatorial optimisation. In EvoWorkshops 2009: LNCS 5484, pages 745-754, 2009. [ bib ] |
| [9] | K. Tang, Y. Mei, and X. Yao. Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Transactions on Evolutionary Computation, 13(5):1151-1166, 2009. [ bib ] |
| [10] | X. Yu, K. Tang, T. Chen, and X. Yao. Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Computing, 1(1):3-24, 2009. [ bib ] |
| [11] | P. Rohlfshagen and X. Yao. Attributes of dynamic combinatorial optimisation. In Lecture Notes in Computer Science, volume 5361, pages 442-451. Springer, 2008. [ bib ] |
| [12] | Y. Mei, K. Tang, and X. Yao. Capacitated arc routing problem in uncertain environments. To appear in Proceedings of the 2010 IEEE Congress on Evolutionary Computation. [ bib ] |
| [13] | Y. Mei, K. Tang, and X. Yao. Decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. To appear in IEEE Transactions on Evolutionary Computation. [ bib ] |
| [14] | P. Rohlfshagen and X. Yao. Dynamic combinatorial optimisation problems: An analysis of the subset sum problems. To appear in Soft Computing (Special issue on Evolutionary Optimization and Learning). [ bib ] |
| [15] | P. Rohlfshagen and X. Yao. On the role of modularity in evolutionary dynamic optimisation. To appear in Proceedings of the 2010 IEEE Congress on Evolutionary Computation. [ bib ] |
| [16] | L. Xing, P. Rohlfshagen, Y. Chen, and X Yao. An evolutionary approach to the multi-depot capacitated arc routing problem. To appear in IEEE Transactions on Evolutionary Computation. [ bib ] |
| [17] | X. Yu, Y. Jin, K. Tang, and X. Yao. Robust optimization over time - a new perspective on dynamic optimization problems. To appear in Proceedings of the IEEE Congress on Evolutionary Computation. [ bib ] |
Parts of this file were generated by bibtex2html 1.95.