Customized Exploration of Landscape Features Driving Multi-Objective Combinatorial Optimization Performance
By: Ana Nikolikj, Gabriela Ochoa, Tome Eftimov
Potential Business Impact:
Helps computers solve hard problems faster.
We present an analysis of landscape features for predicting the performance of multi-objective combinatorial optimization algorithms. We consider features from the recently proposed compressed Pareto Local Optimal Solutions Networks (C-PLOS-net) model of combinatorial landscapes. The benchmark instances are a set of rmnk-landscapes with 2 and 3 objectives and various levels of ruggedness and objective correlation. We consider the performance of three algorithms -- Pareto Local Search (PLS), Global Simple EMO Optimizer (GSEMO), and Non-dominated Sorting Genetic Algorithm (NSGA-II) - using the resolution and hypervolume metrics. Our tailored analysis reveals feature combinations that influence algorithm performance specific to certain landscapes. This study provides deeper insights into feature importance, tailored to specific rmnk-landscapes and algorithms.
Similar Papers
Landscape Features in Single-Objective Continuous Optimization: Have We Hit a Wall in Algorithm Selection Generalization?
Machine Learning (CS)
Helps computers pick the best tool for jobs.
An Explainable Framework for Particle Swarm Optimization using Landscape Analysis and Machine Learning
Neural and Evolutionary Computing
Explains how robot groups work better together.
Parametric Pareto Set Learning for Expensive Multi-Objective Optimization
Neural and Evolutionary Computing
Finds best answers for changing problems instantly.