Skip to main content

An Overview of Pair-Potential Functions for Multi-objective Optimization

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2021)

Abstract

Recently, an increasing number of state-of-the-art Multi-objective Evolutionary Algorithms (MOEAs) have incorporated the so-called pair-potential functions (commonly used to discretize a manifold) to improve the diversity within their population. A remarkable example is the Riesz s-energy function that has been recently used to improve the diversity of solutions either as part of a selection mechanism as well as to generate reference sets. In this paper, we perform an extensive empirical study with respect to the usage of the Riesz s-energy function and other 6 pair-potential functions adopted as a backbone of a selection mechanism used to update an external archive which is integrated into MOEA/D. Our results show that these pair-potential-based archives are able to store solutions with high diversity discarded by the MOEA/D’s main population. Our experimental results indicate that the utilization of the pair-potential-based archives helps to circumvent the known MOEA/D’s performance dependence on the Pareto front shapes without meddling with the original definition of the algorithm.

The first author acknowledges support from CINVESTAV-IPN and CONACyT to pursue graduate studies. The third author acknowledges support from CONACyT grant no. 1920 and from SEP-Cinvestav grant (application no. 4).

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 EPUB and 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

Change history

  • 24 March 2021

    The original version of this chapter was revised. Two equations in section 2.1 have been corrected.

Notes

  1. 1.

    Given \(\varvec{x}, \varvec{y} \in \mathbb {R}^m\), \(\varvec{x}\) is said to Pareto dominate \(\varvec{y}\) (denoted as \(\varvec{x} \prec \varvec{y}\)) if and only if \(x_i \le y_i\) for all \(i=1, \dots , m\) and \(\exists j \in \{1, \dots , m\}\) such that \(x_i < y_i\).

  2. 2.

    The source code is available at http://computacion.cs.cinvestav.mx/~jfalcon/PairPotentials/.

  3. 3.

    All the IGD and PD graphs are available at http://computacion.cs.cinvestav.mx/~jfalcon/PairPotentials/.

References

  1. Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 1–35 (2015)

    Article  Google Scholar 

  2. Borodachov, S.V., Hardin, D.P., Saff, E.B.: Discrete Energy on Rectifiable Sets. Springer Monographs in Mathematics, 1st edn. Springer, New York (2019). https://doi.org/10.1007/978-0-387-84808-2

  3. Falcón-Cardona, J.G., Emmerich, M.T.M., Coello Coello, C.A.: On the cooperation of multiple indicator-based multi-objective evolutionary algorithms. In: Proceedings of CEC 2019, pp. 2050–2057 (2019)

    Google Scholar 

  4. Falcón-Cardona, J.G., Ishibuchi, H., Coello Coello, C.A.: Riesz \(s\)-energy-based reference sets for multi-objective optimization. In: Proceedings of CEC 2020, pp. 1–8 (2020)

    Google Scholar 

  5. Blank, J., Deb, K., Dhebar, Y., Bandaru, S., Seada, H.: Generating well-spaced points on a unit simplex for evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 25, 1 (2020)

    Google Scholar 

  6. Jackson, J.D.: Classical Electrodynamics, 3rd edn. Wiley, Hoboken (1999)

    Google Scholar 

  7. Dong, S.-H.: Pöschl-Teller Potential, pp. 95–110. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-5796-0_7

  8. Hamzavi, M., Ikhdair, S.M.: Approximate \(l\)-state solution of the trigonometric pöschl-teller potential. Mol. Phys. 110(24), 3031–3039 (2012)

    Article  Google Scholar 

  9. Simons, G., Parr, R.G., Finlan, J.M.: New alternative to the Dunham potential for diatomic molecules. J. Chem. Phys. 59(6), 3229–3234 (1973)

    Google Scholar 

  10. Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)

    Article  Google Scholar 

  11. Hisao Ishibuchi, Yu., Setoguchi, H.M., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169–190 (2017)

    Article  Google Scholar 

  12. Coello Coello, C.A., Cortés, N.C.: Solving multiobjective optimization problems using an artificial immune system. Genet. Program. Evol. Mach. 6(2), 163–190 (2005). https://doi.org/10.1007/s10710-005-6164-x

  13. Wang, H., Jin, Y., Yao, X.: Diversity assessment in many-objective optimization. IEEE Trans. Cybern. 47(6), 1510–1522 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jesús Guillermo Falcón-Cardona .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Falcón-Cardona, J.G., Covantes Osuna, E., Coello Coello, C.A. (2021). An Overview of Pair-Potential Functions for Multi-objective Optimization. In: Ishibuchi, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2021. Lecture Notes in Computer Science(), vol 12654. Springer, Cham. https://doi.org/10.1007/978-3-030-72062-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-72062-9_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-72061-2

  • Online ISBN: 978-3-030-72062-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics