Skip to main content

Extending the Delaunay Triangulation Based Density Measurement to Many-Objective Optimization

  • Conference paper
  • First Online:
  • 1068 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10142))

Abstract

This paper investigates the scalability of the Delaunay triangulation (DT) based diversity preservation technique for solving many-objective optimization problems (MaOPs). Following the NSGA-II algorithm, the proposed optimizer with DT based density measurement (NSGAII-DT) determines the density of individuals according to the DT mesh built on the population in the objective space. To reduce the computing time, the population is projected onto a plane before building the DT mesh. Experimental results show that NSGA-II-DT outperforms NSGA-II on WFG problems with 4, 5 and 6 objectives. Two projection strategies using a unit plane and a least-squares plane in the objective space are investigated and compared. Our results also show that the former is more effective than the latter.

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1, 32–49 (2011)

    Article  Google Scholar 

  2. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  3. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary Methods for Design, Optimisation, and Control, pp. 95–100. CIMNE, Barcelona (2002)

    Google Scholar 

  4. Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770–784 (2007)

    Article  Google Scholar 

  5. Li, X.: Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans. Evol. Comput. 14, 150–169 (2010)

    Article  Google Scholar 

  6. Kim, H., Liou, M.-S.: New fitness sharing approach for multi-objective genetic algorithms. J. Glob. Optim. 55, 579–595 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Luo, B., Zheng, J., Xie, J., Wu, J.: Dynamic crowding distance - a new diversity maintenance strategy for MOEAs. In: 4th International Conference on Natural Computation, ICNC 2008. pp. 580–585 (2008)

    Google Scholar 

  8. Kukkonen, S., Deb, K.: A fast and effective method for pruning of non-dominated solutions in many-objective problems. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guervós, Juan, J., Whitley, L.,Darrell, Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 553–562. Springer, Heidelberg (2006). doi:10.1007/11844297_56

    Chapter  Google Scholar 

  9. Qi, Y., Yin, M., Li, X.: A Delaunay triangulation based density measurement for evolutionary multi-objective optimization. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS (LNAI), vol. 9592, pp. 183–192. Springer, Heidelberg (2016). doi:10.1007/978-3-319-28270-1_16

    Chapter  Google Scholar 

  10. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester (2001)

    MATH  Google Scholar 

  11. Dwyer, R.A.: A faster divide-and-conquer algorithm for constructing Delaunay triangulations. Algorithmica 2, 137–151 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide and conquer Delaunay triangulation algorithm in Ed. Comput. Aided Des. 30(5), 333–341 (1998)

    Article  MATH  Google Scholar 

  13. Chernov, N.: Circular and Linear Regression: Fitting Circles and Lines by Least Squares. Monographs on Statistics & Applied Probability. Chapman & Hall/CRC, Boca Raton (2010)

    Book  Google Scholar 

  14. Huband, Simon, Barone, Luigi, While, Lyndon, Hingston, Phil: A scalable multi-objective test problem toolkit. In: Coello Coello, Carlos, A., Hernández Aguirre, Arturo, Zitzler, Eckart (eds.) EMO 2005. LNCS, vol. 3410, pp. 280–295. Springer, Heidelberg (2005). doi:10.1007/978-3-540-31880-4_20

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  16. Seidel, R.: Exact upper bounds for the number of faces in d-dimensional Voronoi diagram. In: Applied Geometry and Discrete Mathematics – The Victor Klee Festschrift, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 517–529 (1991)

    Google Scholar 

  17. Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80–83 (1945)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yutao Qi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Qi, Y., Guo, H., Li, X. (2017). Extending the Delaunay Triangulation Based Density Measurement to Many-Objective Optimization. In: Wagner, M., Li, X., Hendtlass, T. (eds) Artificial Life and Computational Intelligence. ACALCI 2017. Lecture Notes in Computer Science(), vol 10142. Springer, Cham. https://doi.org/10.1007/978-3-319-51691-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51691-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51690-5

  • Online ISBN: 978-3-319-51691-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics