Abstract
Evolutionary Multi-objective Optimization(EMO) is becoming a hot research area and quite a few aspects of Multi-objective Evolutionary algorithms(MOEAs) have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by a representative combinatorial Multi-objective Problem(MOP): Multi-objective TSP. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two kinds of selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using Finite Markov Chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Eckart Zitzler: Evolutionary Algorithm for Multi-Objective Optimization: Methods and Applications. dissertation of Swiss Federal Institute of Technology Zurich for the degree of Doctor of Technical Sciences, November 11, 1999.
Guo Tao: Evolutionary Computation and Optimization. dissertation of Wuhan University for the degree of Doctor of Technical Sciences, May, 2000.
Michalewicz, Z.: How to Solve It: Modern heuristics. Springer-Verlag, Berlin Heidelberg New York 2000
G. Rudolph and A. Agapie: Convergence Properties of Some Multi-Objective Evolutionary Algorithms. Proceedings of the 2000 IEEE Congress on Evolutionary Computation, pp. 1010–1016.
David A. Van Veldhuizen and Gary B. Lamont: Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art. Evolutionary Computation, 2000, 8(2) 125–147
N. Srinivas and Kalyanmoy Deb: Multiobjective Optimization Using Nondominated Sorting In Genetic Algorithms. Evolutionary Computation, 1995, 2(3) 221–248
M. Iosifescu: Finite Markov Processes and Their Applications. Chichester: Wiley, 1980.
G. Rudolph: Convergence properties of canonical genetic algorithms. IEEE Transactions on Neural Networks 1994, 5(1) 96–101.
A. Agapie: Genetic algorithms: Minimal conditions for convergence. Artificial Evolution: Third European Conference; select papers/AE’97, 1998, pp. 183–193. Berlin: Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, Z., Zhang, L., Kang, L., Lin, G. (2003). A New MOEA for Multi-objective TSP and Its Convergence Property Analysis. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive