Skip to main content

A Study on the Performance of Substitute Distance Based Approaches for Evolutionary Many Objective Optimization

  • Conference paper
Simulated Evolution and Learning (SEAL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5361))

Included in the following conference series:

Abstract

Non-dominated Sorting Genetic Algorithm (NSGA-II) [1] and the Strength Pareto Evolutionary Algorithm (SPEA2) [2] are the two most widely used evolutionary multi-objective optimization algorithms. Although, they have been quite successful so far in solving a wide variety of real life optimization problems mostly 2 or 3 objective in nature, their performance is known to deteriorate significantly with an increasing number of objectives. The term many objective optimization refers to problems with number of objectives significantly larger than two or three. In this paper, we provide an overview of the challenges involved in solving many objective optimization problems and provide an in depth study on the performance of recently proposed substitute distance based approaches, viz. Subvector dominance, -eps-dominance, Fuzzy Pareto Dominance and Sub-objective dominance count for NSGA-II to deal with many objective optimization problems. The present study has been conducted on scalable benchmark functions (DTLZ2-DTLZ3) and the recently proposed P* problem [3] since their convergence and diversity measures can be compared conveniently. An alternative substitute distance approach is introduced in this paper and compared with existing ones on the set of benchmark problems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on Evolutionary Computation 6, 182–197 (2002)

    Article  Google Scholar 

  2. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland (2002)

    Google Scholar 

  3. Koppen, M., Yoshida, K.: Substitute distance assignments in NSGA-II for handling many-objective optimization problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 727–741. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization. In: 3rd International Workshop on Genetic and Evolving Systems (GEFS 2008), pp. 47–52 (March 2008)

    Google Scholar 

  5. Khare, V., Yao, X., Deb, K.: Performance Scaling of Multi-objective Evolutionary Algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 376–390. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Corne, D.W., Knowles, J.D.: Techniques for highly multiobjective optimisation: some nondominated points are better than others. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation (GECCO 2007), pp. 773–780. ACM, New York (2007)

    Chapter  Google Scholar 

  7. Sato, H., Aguirre, H., Tanaka, K.: Controlling dominance area of solutions and its impact on the performance of moeas. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 5–20. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 28(3), 392–403 (1998)

    Article  Google Scholar 

  9. Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7(2), 204–223 (2003)

    Article  Google Scholar 

  10. Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research 127(1), 50–71 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zitzler, E., Kunzli, S.: Indicator-Based Selection in Multiobjective Search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Deb, K., Sundar, J.: Reference point based multi-objective optimization using evolutionary algorithms. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation (GECCO 2006), pp. 635–642. ACM, New York (2006)

    Chapter  Google Scholar 

  13. Fleming, P., Purshouse, R., Lygoe, R.: Many-Objective Optimization: An Engineering Design Perspective. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 14–32. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Thiele, L., Miettinen, K., Korhonen, P., Molina, J.: A preference-based interactive evolutionary algorithm for multiobjective optimization. Technical Report W-412, Helsinki School of Economics (2007)

    Google Scholar 

  15. Obayashi, S., Sasaki, D.: Visualization and data mining of pareto solutions using self-organizing map. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 796–809. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Pryke, A., Sanaz Mostaghim, A.N.: Heatmap visualization of population based multi objective algorithms. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 361–375. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Koppen, M., Yoshida, K.: Many-objective particle swarm optimization by gradual leader selection. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 323–331. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Saxena, D.K., Deb, K.: Trading on infeasibility by exploiting constraints criticality through multi-objectivization: A system design perspective. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2007), September 25-28, 2007, pp. 919–926 (2007)

    Google Scholar 

  19. Koppen, M., Vincente-Garcia, R., Nickolay, B.: Fuzzy-pareto-dominance and its application in evolutionary multi-objective optimization. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 399–412. Springer, Heidelberg (2003)

    Google Scholar 

  20. Wagner, T., Beume, N., Naujoks, B.: Pareto-, aggregation-, and indicator-based methods in many-objective optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 742–756. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), vol. 1, pp. 825–830 (May 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singh, H.K., Isaacs, A., Ray, T., Smith, W. (2008). A Study on the Performance of Substitute Distance Based Approaches for Evolutionary Many Objective Optimization. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89694-4_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89693-7

  • Online ISBN: 978-3-540-89694-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics