skip to main content
10.1145/3638529.3653999acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article
Open access

Approximating Pareto Local Optimal Solution Networks

Published: 14 July 2024 Publication History

Abstract

The design of automated landscape-aware techniques requires low-cost features that characterize the structure of the target optimization problem. This paper approximates network-based landscape models of multi-objective optimization problems, which were constructed by full search space enumeration in previous studies. Specifically, we propose a sampling method using dominance-based local search for constructing an approximation of the Pareto local optimal solution network (PLOS-net) and its variant, the compressed PLOS-net. Both models are valuable to visualize and compute features on the distribution of Pareto local optima. We conduct experiments with multi-objective nk-landscapes and compare the features of full-enumerated PLOS-nets with that of approximate PLOS-nets. We analyze the correlation between landscape features and the performance of well-established multi-objective evolutionary and local search algorithms. Our results show that approximated networks can predict algorithm performance and provide recommendation for algorithm selection with the same level of accuracy, even though they are much more computationally affordable compared to full-enumerated networks. We finally illustrate how the approximate PLOS-net scale to large-size instances.

References

[1]
Hernán Aguirre and Kiyoshi Tanaka. 2007. Working principles, behavior, and performance of MOEAs on MNK-landscapes. European Journal of Operational Research 181, 3 (2007), 1670--1690.
[2]
Hanan Alsouly, Michael Kirley, and Mario Andrés Muñoz. 2023. An Instance Space Analysis of Constrained Multiobjective Optimization Problems. IEEE Transactions on Evolutionary Computation 27, 5 (2023), 1427--1439.
[3]
Leo Breiman. 2001. Random Forests. Machine Learning 45, 1 (2001), 5--32.
[4]
Leo Breiman, Jerome Friedman, Charles J. Stone, and R. A. Olshen. 1984. Classification and regression trees. Taylor & Francis, Andover, UK.
[5]
Carlos A. Coello Coello, Gary B. Lamont, and David A. Van Veldhuizen. 2007. Evolutionary Algorithms for Solving Multi-Objective Problems (second ed.). Springer.
[6]
Kalyanmoy Deb. 2001. Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons.
[7]
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182--197.
[8]
David E. Goldberg. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Boston, MA, USA.
[9]
Aric Hagberg, Pieter Swart, and Daniel S Chult. 2008. Exploring network structure, dynamics, and function using NetworkX. Technical Report. Los Alamos National Lab (LANL), Los Alamos, NM, USA.
[10]
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, and Kevin Tierney. 2010. ISAC -Instance-Specific Algorithm Configuration. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010). IOS Press, 751--756.
[11]
Stuart A. Kauffman. 1993. The Origins of Order. Oxford University Press.
[12]
Pascal Kerschke, Holger H. Hoos, Frank Neumann, and Heike Trautmann. 2019. Automated Algorithm Selection: Survey and Perspectives. Evolutionary Computation 27, 1 (2019), 3--45.
[13]
Pascal Kerschke and Mike Preuss. 2019. Exploratory landscape analysis. In Genetic and Evolutionary Computation Conference Companion, GECCO 2019. ACM, Prague, Czech Republic, 1137--1155.
[14]
Pascal Kerschke, Mike Preuss, Simon Wessing, and Heike Trautmann. 2015. Detecting Funnel Structures by Means of Exploratory Landscape Analysis. In Genetic and Evolutionary Computation Conference (GECCO 2015). ACM, Madrid, Spain, 265--272.
[15]
Joshua D. Knowles and David Corne. 2007. Quantifying the Effects of Objective Space Dimension in Evolutionary Multiobjective Optimization. In Evolutionary Multi-Criterion Optimization Conference, EMO 2007 (Lecture Notes in Computer Science, Vol. 4403). Springer, Matsushima, Japan, 757--771.
[16]
Marco Laumanns, Lothar Thiele, and Eckart Zitzler. 2004. Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem. Natural Computing 3, 1 (2004), 37--51.
[17]
Andy Liaw and Matthew Wiener. 2002. Classification and Regression by randomForest. R News 2, 3 (2002), 18--22.
[18]
Arnaud Liefooghe, Fabio Daolio, Sébastien Verel, Bilel Derbel, Hernán Aguirre, and Kiyoshi Tanaka. 2020. Landscape-Aware Performance Prediction for Evolutionary Multiobjective Optimization. IEEE Transactions on Evolutionary Computation 24, 6 (2020), 1063--1077.
[19]
Arnaud Liefooghe, Bilel Derbel, Sébastien Verel, Manuel López-Ibáñez, Hernán Aguirre, and Kiyoshi Tanaka. 2018. On Pareto Local Optimal Solutions Networks. In Parallel Problem Solving from Nature (PPSN XV). Springer, Coimbra, Portugal, 232--244.
[20]
Arnaud Liefooghe, Gabriela Ochoa, Sébastien Verel, and Bilel Derbel. 2023. Pareto local optimal solutions networks with compression, enhanced visualization and expressiveness. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2023). ACM, Lisboa, Portugal, 713--721.
[21]
Arnaud Liefooghe, Sébastien Verel, Benjamin Lacroix, Alexandru-Ciprian Zavoianu, and John A. W. McCall. 2021. Landscape Features and Automated Algorithm Selection for Multi-objective Interpolated Continuous Optimisation Problems. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2021). ACM, Lille, France, 421--429.
[22]
Katherine M. Malan. 2021. A Survey of Advances in Landscape Analysis for Optimisation. Algorithms 14, 2 (2021), 40.
[23]
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and Günter Rudolph. 2011. Exploratory Landscape Analysis. In Genetic and Evolutionary Computation Conference (GECCO 2011). ACM, Dublin, Ireland, 829--836.
[24]
Gabriela Ochoa, Francisco Chicano, and Marco Tomassini. 2020. Global Landscape Structure and the Random MAX-SAT Phase Transition. In Parallel Problem Solving from Nature (PPSN XVI). Springer, Leiden, The Netherlands, 125--138.
[25]
Gabriela Ochoa, Marco Tomassini, Sébastien Verel, and Christian Darabos. 2008. A study of NK landscapes' basins and local optima networks. In Genetic and Evolutionary Computation Conference (GECCO 2008). ACM, Atlanta, GA, USA, 555--562.
[26]
Gabriela Ochoa and Nadarajen Veerapen. 2018. Mapping the global structure of TSP fitness landscapes. Journal of Heuristics 24, 3 (2018), 265--294.
[27]
Luís Paquete, Tommaso Schiavinotto, and Thomas Stützle. 2007. On local optima in multiobjective combinatorial optimization problems. Annals of Operations Research 156, 1 (2007), 83--97.
[28]
Hendrik Richter and Andries Engelbrecht (Eds.). 2014. Recent Advances in the Theory and Application of Fitness Landscapes. Springer.
[29]
Terry Therneau and Beth Atkinson. 2022. rpart: Recursive partitioning and regression trees. R package version 4.1.16.
[30]
Nadarajen Veerapen and Gabriela Ochoa. 2018. Visualising the global structure of search landscapes: genetic improvement as a case study. Genetic Programming and Evolvable Machines 19, 3 (2018), 317--349.
[31]
Sébastien Verel, Arnaud Liefooghe, Laetitia Jourdan, and Clarisse Dhaenens. 2013. On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives. European Journal of Operational Research 227, 2 (2013), 331--342.
[32]
Aljoša Vodopija, Tea Tušar, and Bogdan Filipič. 2022. Characterization of constrained continuous multiobjective optimization problems: A feature space perspective. Information Sciences 607 (2022), 244--262.
[33]
E. D. Weinberger. 1990. Correlated and uncorrelatated fitness landscapes and how to tell the difference. Biological Cybernetics 63, 5 (1990), 325--336.
[34]
Eckart Zitzler, Lothar Thiele, Marco Laumanns, Carlos M Fonseca, and Viviane Grunert Da Fonseca. 2003. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7, 2 (2003), 117--132.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '24: Proceedings of the Genetic and Evolutionary Computation Conference
July 2024
1657 pages
ISBN:9798400704949
DOI:10.1145/3638529
This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2024

Check for updates

Author Tags

  1. multi-objective optimization
  2. landscape analysis
  3. NK-landscapes

Qualifiers

  • Research-article

Conference

GECCO '24
Sponsor:
GECCO '24: Genetic and Evolutionary Computation Conference
July 14 - 18, 2024
VIC, Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 93
    Total Downloads
  • Downloads (Last 12 months)93
  • Downloads (Last 6 weeks)11
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media