Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems

Multi-objectivization is a term used to describe strategies developed for optimizing single-objective problems by multi-objective algorithms. This paper focuses on multi-objectivizing the sum-of-the-parts combinatorial optimization problems, which include the traveling salesman problem, the unconstr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied soft computing Ročník 103; s. 107157
Hlavní autoři: Shi, Jialong, Sun, Jianyong, Zhang, Qingfu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.05.2021
Témata:
Combinatorial optimization
Local search
Multi-objectivization
Traveling salesman problem
Multi-objectivization
Local search
Traveling salesman problem
Combinatorial optimization
ISSN:1568-4946, 1872-9681
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Multi-objectivization is a term used to describe strategies developed for optimizing single-objective problems by multi-objective algorithms. This paper focuses on multi-objectivizing the sum-of-the-parts combinatorial optimization problems, which include the traveling salesman problem, the unconstrained binary quadratic programming and other well-known combinatorial optimization problem. For a sum-of-the-parts combinatorial optimization problem, we propose to decompose its original objective into two sub-objectives with controllable correlation. Based on the decomposition method, two new multi-objectivization inspired single-objective optimization techniques called non-dominance search and non-dominance exploitation are developed, respectively. Non-dominance search is combined with two metaheuristics, namely iterated local search and iterated tabu search, while non-dominance exploitation is embedded within the iterated Lin–Kernighan metaheuristic. The resultant metaheuristics are called ILS+NDS, ITS+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, ITS+NDS and ILK+NDE all significantly outperform their counterparts on most of the test instances. •This paper proposes a new method to convert a sum-of-the-parts combinatorial optimization problem (e.g. the TSP) into a biobjective problem.•Guided by the bi-objective problem, we propose two new techniques called NDS and NDE that can enhance existing single-objective local search based metaheuristics.•To verify the effect of NDS and NDE, we combine NDS with Iterated Local Search (ILS) and with Iterated Tabu Search (ITS), and combine NDE with Iterated Lin–Kernighan algorithm (ILK).•Experimental results on some TSP and UBQP instances show that the resultant ILS+NDS, ITS+NDS and ILK+NDE all significantly outperform their counterparts on most of the test instances.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2021.107157