Pareto Local Optimal Solutions Networks with Compression, Enhanced Visualization and Expressiveness

The structure of local optima in multi-objective combinatorial optimization and their impact on algorithm performance are not yet properly understood. In this paper, we are interested in the representation of multi-objective landscapes and their multi-modality. More specifically, we revise and extend the network of Pareto local optimal solutions (PLOS-net), inspired by the well-established local optima network from single-objective optimization. We first define a compressed PLOS-net which allows us to enhance its perception while preserving the important notion of connectedness between local optima. We then study an alternative visualization of the (compressed) PLOS-net that focuses on good-quality solutions, improves the distinction between connected components in the network, and generalizes well to landscapes with more than 2 objectives. We finally define a number of network metrics that characterize the PLOS-net, some of them being strongly correlated with search performance. We visualize and experiment with small-size multiobjective nk-landscapes, and we disclose the effect of PLOS-net metrics against well-established multi-objective local search and evolutionary algorithms.

[1]  Katherine Malan,et al.  Recent advances in landscape analysis for optimisation and learning , 2021, GECCO Companion.

[2]  Jonathan E. Fieldsend,et al.  A Visualizable Test Problem Generator for Many-Objective Optimization , 2021, IEEE Transactions on Evolutionary Computation.

[3]  Katherine Mary Malan,et al.  A Survey of Advances in Landscape Analysis for Optimisation , 2021, Algorithms.

[4]  Bilel Derbel,et al.  Landscape-Aware Performance Prediction for Evolutionary Multiobjective Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[5]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[6]  Gabriela Ochoa,et al.  Inferring Future Landscapes: Sampling the Local Optima Level , 2020, Evolutionary Computation.

[7]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[8]  Jonathan E. Fieldsend,et al.  Visualising the landscape of multi-objective problems using local optima networks , 2019, GECCO.

[9]  Sébastien Vérel,et al.  On Pareto Local Optimal Solutions Networks , 2018, PPSN.

[10]  Gabriela Ochoa,et al.  Comparing communities of optima with funnels in combinatorial fitness landscapes , 2017, GECCO.

[11]  Marco Tomassini,et al.  Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study , 2017, EvoCOP.

[12]  Pascal Kerschke,et al.  An Expedition to Multimodal Multi-objective Optimization Landscapes , 2017, EMO.

[13]  Sébastien Vérel,et al.  Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes , 2016, Evolutionary Computation.

[14]  Tea Tusar,et al.  Visualization of Pareto Front Approximations in Evolutionary Multiobjective Optimization: A Critical Review and the Prosection Method , 2015, IEEE Transactions on Evolutionary Computation.

[15]  Andries P. Engelbrecht,et al.  Recent Advances in the Theory and Application of Fitness Landscapes , 2013 .

[16]  Sébastien Vérel,et al.  On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives , 2013, Eur. J. Oper. Res..

[17]  Bernd Bischl,et al.  Exploratory landscape analysis , 2011, GECCO '11.

[18]  Sébastien Vérel,et al.  A study of NK landscapes' basins and local optima networks , 2008, GECCO '08.

[19]  Kiyoshi Tanaka,et al.  Working principles, behavior, and performance of MOEAs on MNK-landscapes , 2007, Eur. J. Oper. Res..

[20]  Thomas Stützle,et al.  On local optima in multiobjective combinatorial optimization problems , 2007, Ann. Oper. Res..

[21]  David W. Corne,et al.  Quantifying the Effects of Objective Space Dimension in Evolutionary Multiobjective Optimization , 2007, EMO.

[22]  Yehuda Koren,et al.  Graph Drawing by Stress Majorization , 2004, GD.

[23]  Marco Laumanns,et al.  Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem , 2004, Natural Computing.

[24]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[25]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[26]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[27]  Peter J. Fleming,et al.  On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.

[28]  Nuno Lourenço,et al.  Parallel Problem Solving from Nature – PPSN XV , 2018, Lecture Notes in Computer Science.

[29]  Andy Liaw,et al.  Classification and Regression by randomForest , 2007 .

[30]  L. Breiman Random Forests , 2001, Machine Learning.

[31]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[32]  Aaron Sloman,et al.  Parallel Problem Solving from Nature – PPSN XVI , 2000 .

[33]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[34]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .