Abstract
This paper explores some simple evolutionary strategies for an elitist, steady-state Pareto-based multi-objective evolutionary algorithm. The experimental framework is based on the SEAMO algorithm which differs from other approaches in its reliance on simple population replacement strategies, rather than sophisticated selection mechanisms. The paper demonstrates that excellent results can be obtained without the need for dominance rankings or global fitness calculations. Furthermore, the experimental results clearly indicate which of the population replacement techniques are the most effective, and these are then combined to produce an improved version of the SEAMO algorithm. Further experiments indicate the approach is competitive with other state-of-the-art multi-objective evolutionary algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Corne, D.W., Knowles, J.D., Oates, M.J.: The Pareto envelope-based selection algorithm for multiobjective optimization. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 839–848. Springer, Heidelberg (2000)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for mult-objective optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)
Mumford, C.L (Valenzuela).: Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem. In: Congress on Evolutionary Computation (CEC) Canberra Australia, pp. 854–861 (2003)
Mumford, C. L (Valenzuela).: A hierarchical approach to multi-objective optimization. In: Congress on Evolutionary Computation (CEC) Portland, Oregon (2004) (to appear)
Mumford-Valenzuela, C.L.: A Simple Approach to Evolutionary Multi-Objective Optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Computation Based Multi-Criteria Optimization: Theoretical Advances and Applications, Springer Verlag, London (2004)
Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 224–230 (1987)
Valenzuela, C.L.: A simple evolutionary algorithm for multi-objective optimization (SEAMO). In: Congress on Evolutionary Computation (CEC), Honolulu, Hawaii, pp. 717–722 (2002)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm, TIK-Report 103, Department of Electrical Engineering, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, zitzler, laumanns, thiele tik.ee.ethz.ch(2001), Data and results downloaded from: http://www.tik.ee.ethz.ch/zitzler/testdata.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mumford, C.L. (2004). Simple Population Replacement Strategies for a Steady-State Multi-objective Evolutionary Algorithm. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_132
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_132
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive