A Simple Approach to Evolutionary Multiobjective Optimization

  • Christine L. Mumford-Valenzuela
Part of the Advanced Information and Knowledge Processing book series (AI&KP)


This chapter describes a Pareto-based approach to evolutionary multiobjective optimization, that avoids most of the time-consuming global calculations typical of other multi-objective evolutionary techniques. The new approach uses a simple uniform selection strategy within a steady-state evolutionary algorithm (EA) and employs a straightforward elitist mechanism for replacing population members with their offspring. Global calculations for fitness and Pareto dominance are not needed. Other state-of-the-art Pareto-based EAs depend heavily on various fitness functions and niche evaluations, mostly based on Pareto dominance, and the calculations involved tend to be rather time consuming (at least O(N2) for a population size, N). The new approach has performed well on some benchmark combinatorial problems and continuous functions, outperforming the latest state-of-the-art EAs in several cases. In this chapter the new approach will be explained in detail.


Genetic Algorithm Pareto Front Multiobjective Optimization Knapsack Problem Solution Vector 
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.
    Valenzuela, CL, A Simple Evolutionary Algorithm for Multi-objective Optimization (SEAMO), Congress on Evolutionary Computation (CEC), Honolulu, Hawaii, 12–17th May 2002, pp. 717–722, 2002.Google Scholar
  2. 2.
    Goldberg, DE, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, USA, 1989.Google Scholar
  3. 3.
    Fonseca, CM and Fleming, PJ, Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization, Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 416–423, Morgan Kaufmann, 1993.Google Scholar
  4. 4.
    Horn, J, Nafpliotis, N and Goldberg, DE, A Niched Pareto Genetic Algorithm for Multiobjective Optimization, Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Volume 1, pp. 82–87, IEEE Press, 1994.Google Scholar
  5. 5.
    Corne, DW, Knowles, JD and Oates, MJ, The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization. Parallel Problem Solving from Nature-PPSN VI, Lecture Notes in Computer Science 1917, pp. 839–848, Springer, 2000.Google Scholar
  6. 6.
    Zitzler, E and Thiele, L, Multiobjective evolutionary algorithms: A Comparative Case Study and the Strength Pareto Approach, IEEE Transactions on Evolutionary Computation, 1999; 3(4)1999: 257–271.CrossRefGoogle Scholar
  7. 7.
    Cavicchio, DJ, Adaptive Search Using Simulated Evolution, PhD dissertation, University of Michigan, Ann Arbor, 1970.Google Scholar
  8. 8.
    Michalewicz, Z, Genetic Algorithms + Data Structures = Evolutionary Programs, Third, revised and extended edition, Springer, Berlin, 1996.Google Scholar
  9. 9.
    Mumford, CL (Valenzuela), Comparing Representations and Recombination Operators for the Multi-objective 0/1 Knapsack Problem, Congress on Evolutionary Computation (CEC), Canberra, Australia, 2003, pp. 854–861, 2003.Google Scholar
  10. 10.
    Oliver, IM, Smith, DJ and Holland JRC, A Study of Permutation Crossover Operators on the Traveling Salesman Problem, Genetic Algorithms and their Applications:Proceedings of the Second International Conference on Genetic Algorithms, pp. 224–230, 1987.Google Scholar
  11. 11.
    Goldberg, DE and Lingle R, Alleles, Loci and the TSP, Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 154–159, Pittsburgh, PA, 1985.Google Scholar
  12. 12.
    Mühlenbein, H, Gorges-Schleuter, M and Krämer O, Evolution Algorithms in Combinatorial Optimization, Parallel Computing, 1988, 7:65–85.CrossRefGoogle Scholar
  13. 13.
    Davis, L, Applying Adaptive Algorithms to Epistatic Domains, Proceedings of the Joint International Conference on Artificial Intelligence, pp. 162–164, 1985.Google Scholar
  14. 14.
    Davis, L, Order-based Genetic Algorithms and the Graph Coloring problem, Handbook of Genetic Algorithms pp. 72–90, New York, Van Nostrand Reinhold, 1991.Google Scholar
  15. 15.
    Zitzler, E, Laumanns, M and Thiele, L, SPEA2: Improving the Strength Pareto Evolutionary Algorithm, TIK-Report 103, Department of Electrical Engineering, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2001 {zitzler, laumanns, thiele} Scholar
  16. 16.
    Deb, K, Agrawal, S, Pratap, A and Meyarivan, T A Fast Elitist Non-dominated Sorting Genetic Algorithm for Mult-objective Optimization: NSGA-II, Parallel Problem Solving from Nature-PPSN VI, Lecture Notes in Computer Science 1917, pp. 849–858, Springer, 2000.Google Scholar
  17. 17.
    Schaffer, JD Multiple Objective Optimization with Vector Evaluated Genetic Algorithms, Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 93–100, Pittsburgh, PA, 1985.Google Scholar
  18. 18.
    Laumanns, M, Rudolph, G and Schwefel, HP Mutation Control and Convergence in Evolutionary Multiobjective Optimization. Proceedings of the 7th International Mendel Conference on soft Computing (MENDEL 2001), Brno, Czech Republic, 2001.Google Scholar
  19. 19.
    Zitzler, E, Deb, K and Thiel, L Comparison of Multiobjective Evolutionary Algorithms: Empirical Results, Evolutionary Computation, 2000; 8(2):173–195.CrossRefPubMedGoogle Scholar
  20. 20.
    Quagliarella, D and Vicini, A Coupling Genetic Algorithms and Gradient Based Optimization Techniques. In D. Quagliarella, J. Périaux, C Poloni, and G. Winter (eds) Genetic Algorithms and Evolution Strategy in Engineering and Computer Science — Recent Advances and Industrial Applications, pp. 289–309, Chichester, Wiley, 1997.Google Scholar
  21. 21.
    Kursawe, F A Variant of Evolution Strategies for Vector Optimization. In H.-P. Schewefel and R. Männer (eds), Parallel Problem Solving from Nature Berlin, pp. 193–197, Springer, 1991.Google Scholar
  22. 22.
    Syswereda, G Uniform Crossover in Genetic Algorithms, Genetic Algorithms and their Applications:Proceedings of the Third International Conference on Genetic Algorithms, pp. 2–9, 1989.Google Scholar
  23. 23.
    Jaskiewicz, A On the Performance of Multiple Objective Genetic Local Search on the 0/1 Knapsack Problem-A Comparative Experiment, IEEE Transactions on Evolutionary Computation, 2002, 6(4):402–412.CrossRefGoogle Scholar
  24. 24.
    Hajela, P, and Lin, CY Genetic Search Strategies in Multicriterion Optimal Design, Structural Optimization, Volume 4, pp. 99–107, New York: Springer, 1992.Google Scholar

Copyright information

© Springer-Verlag London Limited 2005

Authors and Affiliations

  • Christine L. Mumford-Valenzuela

There are no affiliations available

Personalised recommendations