Novel Multi-Objectivization Approaches for the Sum-of-the-Parts Combinatorial Optimization Problems

11/12/2019
by   Jialong Shi, et al.
0

Multi-objectivization is a term used to describe strategies developed for optimizing single-objective problems by multi-objective algorithms. This paper focuses on the multi-objectivization of the sum-of-the-parts Combinatorial Optimization Problems (COPs), which include the Traveling Salesman Problem (TSP), the Unconstrained Binary Quadratic Programming (UBQP) and other well-known COPs. For a sum-of-the-parts COP, we propose to decompose its original objective into two sub-objectives with controllable correlation. Based on the decomposition method, two new multi-objectivization techniques called Non-Dominance Search (NDS) and Non-Dominance Exploitation (NDE) are developed, respectively. NDS is combined with the Iterated Local Search (ILS) metaheuristic (with fixed neighborhood structure), while NDE is embedded within the Iterated Lin-Kernighan (ILK) metaheuristic (with varied neighborhood structure). The resultant metaheuristics are called ILS+NDS and ILK+NDE, respectively. Empirical studies on some TSP and UBQP instances show that with appropriate correlation between the sub-objectives, there are more chances to escape from local optima when new starting solution is selected from the non-dominated solutions defined by the decomposed sub-objectives. Experimental results also show that ILS+NDS and ILK+NDE both significantly outperform their counterparts on most of the test instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2019

Multi-Objectivizing Sum-of-the-Parts Combinatorial Optimization Problems by Random Objective Decomposition

Multi-objectivization is a term used to describe strategies developed fo...
research
09/19/2014

Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives

The properties of local optimal solutions in multi-objective combinatori...
research
07/18/2012

Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives

In this paper, we conduct a fitness landscape analysis for multiobjectiv...
research
10/27/2022

End-to-End Pareto Set Prediction with Graph Neural Networks for Multi-objective Facility Location

The facility location problems (FLPs) are a typical class of NP-hard com...
research
07/19/2012

Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes

In multiobjective combinatorial optimization, there exists two main clas...
research
12/22/2018

Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application

In this paper, we present a method using AI techniques to solve a case o...
research
03/11/2022

Solving Multi-Structured Problems by Introducing Linkage Kernels into GOMEA

Model-Based Evolutionary Algorithms (MBEAs) can be highly scalable by vi...

Please sign up or login with your details

Forgot password? Click here to reset