Skip to main content

Implementation Techniques for Massively Parallel Multi-objective Optimization

  • Chapter
  • First Online:
Massively Parallel Evolutionary Computation on GPGPUs

Part of the book series: Natural Computing Series ((NCS))

Abstract

Most real-world search and optimization problems involve more than one goal. The task of finding multiple optimal solutions for such problems is known as multi-objective optimization (MOO). It has been a challenge for researchers and practitioners to find solutions for MOO problems. Many techniques have been developed in operations research and other related disciplines, but the complexity of MOO problems such as large search spaces, uncertainty, noise, and disjoint Pareto curves may prevent the use of these techniques. At this stage, evolutionary algorithms (EAs) are preferred and have been extensively used for the last two decades. The main reason is that EAs are population-based techniques which can evolve a Pareto front in one run. But EAs require a relatively large computation time. A remedy is to perform function evaluations in parallel. But another bottleneck is Pareto ranking in multi-objective evolutionary algorithms. In this chapter, a brief introduction to MOO and techniques used to solve MOO problems is given. Thereafter, a GPGPU-based archive stochastic ranking evolutionary algorithm is discussed that can perform function evaluations and ranking on a massively parallel GPU card. Results are compared with CPU and GPU versions of NSGA-II.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Source codes for NSGA-II and SPEA2 are available at [16] and [25].

  2. 2.

    Note that only one run is performed for 1 million individuals on each ZDT function.

References

  1. Baumes, L., Blansch, A., Serna, P., Tchougang, A., Lachiche, N., Collet, P. Corma, A.: Using genetic programming for an advanced performance assessment of industrially relevant heterogeneous catalysts. Mater. Manuf. Process. 24(3), (March 2009)

    Google Scholar 

  2. Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-objective Problems. Springer, New York (2007)

    MATH  Google Scholar 

  3. Corne, D.W., Jerram, N.R., Knowles, J.D., Oates, M.J.: PESA-II: Region-based selection in evolutionary multiobjective optimization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2001), pp. 283–290. Morgan Kaufmann Publishers, San Francisco, CA (2001)

    Google Scholar 

  4. Corne, D.W., Knowles, J.D., Oates, M.J.: The Pareto envelope-based selection algorithm for multiobjective optimization. In Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 839–848. Springer, Paris (2000)

    Google Scholar 

  5. Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, Wiley, Chichester, UK (2001)

    MATH  Google Scholar 

  6. Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Systems. 9(2), 115–148 (1995)

    MathSciNet  MATH  Google Scholar 

  7. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182 –197 (April 2002)

    Article  Google Scholar 

  8. Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)

    MATH  Google Scholar 

  9. Fonseca, C.M., Fleming, P.J.: Genetic algorithms for multi-objective optimization: Formulation, discussion, and generalization. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 416–423. Morgan Kaufmann, San Mateo, CA (1993)

    Google Scholar 

  10. Fonseca, C.M., Fleming, P.J.: On the performance assessment and comparison of stochastic multiobjective optimizers. In: Proceedings of Parallel Problem Solving from Nature IV (PPSN-IV), pp. 584–593. Springer, Berlin (1996)

    Google Scholar 

  11. Fonseca, C.M., Fonseca, V.G., Paquete, L.: Exploring the performance of stochastic multiobjective optimizers with the second-order attainment functions. In: Proceedings of the Third Evolutionary Multi-criterion Optimization (EMO-05) Conference, pp. 250–264. Springer, Berlin (2005)

    Google Scholar 

  12. Fonseca, V.G., Fonseca, C.M., Hall, A.O.: Inferential performance assessment of stochastic optimizers and the attainment function. In: Proceedings of the First Evolutionary Multi-criterion Optimization (EMO-01) Conference, pp. 213–225. Springer, Berlin (2001)

    Google Scholar 

  13. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, New York (1989)

    MATH  Google Scholar 

  14. Hansen, M.P., Jaszkiewicz, A.: Evaluating the Quality of Approximations to the Non-dominated Set. Imm-rep-1998-7, Technical University of Denmark, 1998

    Google Scholar 

  15. Horn, J., Nafploitis, N., Goldberg, D.E.: A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the First IEEE Conference on Evolutionary Computation, Genetic Algorithms Laboratory, Illinois University, Urbana, IL, USA pp. 82–87, 1994

    Google Scholar 

  16. KanGAL. NSGA-II in C with gnuplot (real + binary + constraint handling): Revision 1.1. http://www.iitk.ac.in/kangal/codes.shtml, July 26 2013

  17. Knowles, J., Corne, D.: Properties of an adaptive archiving algorithm for storing nondominated vectors. IEEE Trans. Evol. Comput. 7(2), 100–116 (2003)

    Article  Google Scholar 

  18. Knowles, J., Thiele, L. Zitzler, E.: A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. TIK Report 214, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, February 2006

    Google Scholar 

  19. Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Archiving with Guaranteed Convergence and Diversity in Multi-objective Optimization. In: Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 439–447, Morgan Kaufmann Publishers, New York, NY, USA (July 2002)

    Google Scholar 

  20. Maitre, O., Baumes, L.A., Lachiche, N., Corma, A., Collet, P.: Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA. In: GECCO ’09: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 1403–1410, ACM, New York, NY, USA, 2009

    Google Scholar 

  21. Maitre, O., Querry, S., Lachiche, N., Collet, P.: EASEA parallelization of tree-based genetic programming. In: IEEE Congress on Evolutionary Computation (CEC 2010), University of Strasbourg, Illkirch, France, 2010

    Google Scholar 

  22. Parks, G.T., Miller, I.: Selective breeding in a multiobjective genetic algorithm. In: Eiben, A.E., Schoenauer, M., Schwefel, H.P. (eds.) Proceedings of the Parallel Problem Solving from Nature V (PPSN-V), pp. 250–259. Springer, Amsterdam, Netherlands (1998)

    Chapter  Google Scholar 

  23. Sharma, D., Collet, P.: An archived-based stochastic ranking evolutionary algorithm (ASREA) for multi-objective optimization. In: GECCO ’10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 479–486. ACM, New York, NY, USA, 2010

    Google Scholar 

  24. Sharma, D., Collet, P.: GPGPU-Compatible archive based stochastic ranking evolutionary algorithm (G-ASREA) for multi-objective optimization. In: Schaefer, R., Cotta, C., Kolodziej, J., Rudolph, G. (eds.) PPSN (2). Lecture Notes in Computer Science, vol. 6239, pp. 111–120. Springer, Berlin (2010)

    Google Scholar 

  25. TIK. A platform and programming language independent interface for search algorithms. http://www.tik.ee.ethz.ch/pisa/. July 26 2013

  26. Wong, M.L.: Parallel multi-objective evolutionary algorithms on graphics processing units. In: GECCO ’09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, pp. 2515–2522. ACM, New York, NY, USA, 2009

    Google Scholar 

  27. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. Evol. Comput. 8(2), 125–148 (2000)

    Article  Google Scholar 

  28. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K. et al. (eds.) Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pp. 95–100. International Center for Numerical Methods in Engineering (CIMNE), 2002

    Google Scholar 

  29. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)

    Article  Google Scholar 

  30. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deepak Sharma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sharma, D., Collet, P. (2013). Implementation Techniques for Massively Parallel Multi-objective Optimization. In: Tsutsui, S., Collet, P. (eds) Massively Parallel Evolutionary Computation on GPGPUs. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37959-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37959-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37958-1

  • Online ISBN: 978-3-642-37959-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics