Simple Population Replacement Strategies for a Steady-State Multi-objective Evolutionary Algorithm

  • Christine L. Mumford
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3102)


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.


Multiobjective Optimization Dominance Ranking Population Member Multiobjective Evolutionary Algorithm Multiple Knapsack Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  4. 4.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)zbMATHGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Mumford, C. L (Valenzuela).: A hierarchical approach to multi-objective optimization. In: Congress on Evolutionary Computation (CEC) Portland, Oregon (2004) (to appear)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Valenzuela, C.L.: A simple evolutionary algorithm for multi-objective optimization (SEAMO). In: Congress on Evolutionary Computation (CEC), Honolulu, Hawaii, pp. 717–722 (2002)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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, Data and results downloaded from:

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Christine L. Mumford
    • 1
  1. 1.School of Computer ScienceCardiff UniversityCardiffUnited Kingdom

Personalised recommendations