Abstract:
We present four abstract evolutionary algorithms for multi-objective optimization and theoretical results that characterize their convergence behavior. Thanks to these re...Show MoreMetadata
Abstract:
We present four abstract evolutionary algorithms for multi-objective optimization and theoretical results that characterize their convergence behavior. Thanks to these results it is easy to verify whether or not a particular instantiation of these abstract evolutionary algorithms offers the desired limit behavior. Several examples are given.
Published in: Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
Date of Conference: 16-19 July 2000
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-6375-2
References is not available for this document.
Select All
1.
A. Agapie (1998a). Genetic algorithms: Minimal conditions for convergence. In J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (Eds. ), Artificial Evolution: Third European Conference; selected papers / AE '97, pp. 183-193. Berlin: Springer.
2.
A. Agapie (1998b). Modelling genetic algorithms: From markov chains to dependance with complete connections. In T. Bäck, A. E. Eiben, M. Schoenauer, and H.-P. Schwefel (Eds. ), Parallel Problem Solving From Nature - PPSN V, pp. 3-12. Berlin: Springer.
3.
T. Bäck (1996). Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press.
4.
W. Feller (1970). An Introduction to Probability Theory and Its Applications Vol. 1 (3rd (revised) ed. ). Singapore: Wiley.
5.
C. M. Fonseca and P. J. Fleming (1995). An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3(1), 1-16.
6.
T. Hanne (1999). On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research 117(3), 553-564.
7.
R. F. Hartl (1990). A global convergence proof for a class of genetic algorithms. Technical report, Institute of Econometrics, Operations Research and Systems Theory, Vienna University of Technology.
8.
J. Horn (1997). Multicriterion decision making. In T. Bäck, D. B. Fogel, and Z. Michalewicz (Eds. ), Handbook of Evolutionary Computation, pp. F1. 9:1-15. New York and Bristol (UK): IOP Publishing and Oxford University Press.
9.
M. Iosifescu (1980). Finite Markov Processes and Their Applications. Chichester: Wiley.
10.
M. Iosifescu and S. Grigorescu (1990). Dependence with complete connections and its applications. Cambridge: Cambridge University Press.
11.
M. Peschel and C. Riedel (1977). Use of vector optimization in multiobjective decision making. In D. E. Bell, R. L. Keeney, and H. Raiffa (Eds. ), Conflicting Objectives in Decisions, pp. 97-121. Chichester: Wiley.
12.
G. Rudolph (1994). Convergence properties of canonical genetic algorithms. IEEE Transactions on Neural Networks 5(1), 96-101.
13.
G. Rudolph (1998a). Evolutionary search for minimal elements in partially ordered finite sets. In V. W. Porto, N. Saravanan, D. Waagen, and A. E. Eiben (Eds. ), Evolutionary Programming VII, Proceedings of the 7th Annual Conference on Evolutionary Programming, pp. 345-353. Berlin: Springer.
14.
G. Rudolph (1998b). On a multi-objective evolutionary algorithm and its convergence to the Pareto set. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 511-516. Piscataway (NJ): IEEE Press.
15.
D. A. van Veldhuizen (1999). Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. Ph. D. thesis, Air Force Institute of Technology, Wright-Patterson Air Force Base, Ohio.
