Multi-objective Co-operative Co-evolutionary Genetic Algorithm

  • Nattavut Keerativuttitumrong
  • Nachol Chaiyaratana
  • Vara Varavithya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2439)


This paper presents the integration between two types of genetic algorithm: a multi-objective genetic algorithm (MOGA) and a co-operative co-evolutionary genetic algorithm (CCGA). The resulting algorithm is referred to as a multi-objective co-operative co-evolutionary genetic algorithm or MOCCGA. The integration between the two algorithms is carried out in order to improve the performance of the MOGA by adding the co-operative co-evolutionary effect to the search mechanisms employed by the MOGA. The MOCCGA is benchmarked against the MOGA in six different test cases. The test problems cover six di.erent characteristics that can be found within multi-objective optimisation problems: convex Pareto front, non-convex Pareto front, discrete Pareto front, multi-modality, deceptive Pareto front and non-uniformity in the solution distribution. The simulation results indicate that overall the MOCCGA is superior to the MOGA in terms of the variety in solutions generated and the closeness of solutions to the true Pareto-optimal solutions. A simple parallel implementation of MOCCGA is described. With an 8-node cluster, the speed up of 2.69 to 4.8 can be achieved for the test problems.


Genetic Algorithm Test Problem Pareto Front Multiobjective Evolutionary Algorithm Multiobjective Genetic Algorithm 
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. 1989.
    Baker, J. E.: An analysis of the e.ects of selection in genetic algorithms, Ph.D. Thesis. Computer Science Department, Vanderbilt University, Nashville, TN (1989)Google Scholar
  2. 1993.
    Fonseca, C. M. and Fleming, P. J.: Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. Genetic Algorithms. Proceedings of the Fifth International Conference, Urbana-Champaign, IL (1993) 416–423Google Scholar
  3. 1995.
    Fonseca, C. M. and Fleming, P. J.: Multiobjective genetic algorithms made easy: Selection, sharing and mating restriction. The Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA’95), Sheffield, UK (1995) 45–52Google Scholar
  4. 1998.
    Fonseca, C. M. and Fleming, P. J.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms-Part 1: A unified formulation. IEEE Transactions on Systems, Man, and Cybernetics 28(1) (1998) 26–37CrossRefGoogle Scholar
  5. 1985.
    Fourman, M. P.: Compaction of symbolic layout using genetic algorithms. Proceedings of the First International Conference on Genetic Algorithms and Their Applications (1985) 141–153Google Scholar
  6. 1990.
    Gorges-Scheleuter, M.: Explicit parallelism of genetic algorithms through population structures. Parallel Problem Solving from Nature (1990) 150–159Google Scholar
  7. 1992.
    Hajela, P. and Lin, C. Y.: Genetic search strategies in multicriterion optimal design. Structural Optimization 4 (1992) 99–107CrossRefGoogle Scholar
  8. 1996.
    Hart, W. E., Baden, S., Bekew, R. K. and Kohn, S.: Analysis of the numerical effects of parallelism on a parallel genetic algorithm. Proceeding of the Tenth International Parallel Processing Symposium (1996) 606–612Google Scholar
  9. 1993.
    Horn, J. and Nafpliotis, N.: Multiobjective optimization using the niched pareto genetic algorithm. IlliGAL Report No. 93005, Department of Computer Science, Department of General Engineering, University of Illinois at Urbana-Champaign, Urbana-Champaign, IL (1993)Google Scholar
  10. 1997.
    Matsumura, T., Nakamura, M. and Okech, J.: Effect of chromosome migration on a parallel and distributed genetic algorithm. International Symposium on Parallel Architecture, Algorithm and Networks (ISPAN’97) (1997) 357–612Google Scholar
  11. 1997.
    Patrick D., Green, P. and York, T.: A distributed genetic algorithm environment for unix workstation clusters. Genetic Algorithms in Engineering Systems: Innovations and Applications (1997) 69–74Google Scholar
  12. 1994.
    Potter, M. A. and De Jong, K. A.: A cooperative coevolutionary approach to function optimization. Proceedings of the Third International Conference on Parallel Problem Solving from Nature (PPSNIII), Jerusalem, Israel (1994) 249–257Google Scholar
  13. 2000.
    Potter, M. A. and De Jong, K. A.: Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evolutionary Computation 8(1) (2000) 1–29CrossRefGoogle Scholar
  14. 1984.
    Schaffer, J. D.: Some experiments in machine learning using vector evaluated genetic algorithms, Ph.D. Thesis. Vanderbilt University, Nashville, TN (1984)Google Scholar
  15. 1991.
    Spiessens, P., and Manderick, B.: A massively parallel genetic algorithm: Implementation and first analysis. The Fourth International Conference on Genetic Algorithms (1991) 279–285Google Scholar
  16. 1999.
    Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4) (1999) 257–271CrossRefGoogle Scholar
  17. 2000.
    Zitzler, E., Deb, K. and Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation 8(2) (2000) 173–195CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Nattavut Keerativuttitumrong
    • 2
  • Nachol Chaiyaratana
    • 1
  • Vara Varavithya
    • 2
  1. 1.Research and Development Center for Intelligent SystemsThailand
  2. 2.Department of Electrical EngineeringKing Mongkut’s Institute of Technology North BangkokBangkokThailand

Personalised recommendations