Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW

被引:0
作者
Legrand, Clement [1 ]
Cattaruzza, Diego [2 ]
Jourdan, Laetitia [1 ]
Kessaci, Marie-Eleonore [1 ]
机构
[1] Univ Lille, Cent Lille, CNRS, UMR 9189,CRIStAL, F-59000 Lille, France
[2] Univ Lille, Cent Lille, CRIStAL, CNRS,Inria,UMR 9189, F-59000 Lille, France
来源
METAHEURISTICS, MIC 2024, PT I | 2024年 / 14753卷
关键词
Combinatorial Optimization; Multi-Objective Optimization; Online Learning; Genetic Algorithm; Local Search; ALGORITHM; SEARCH; MOEA/D;
D O I
10.1007/978-3-031-62912-9_7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Hybridizing learning and optimization often improves existing algorithms in single-objective optimization. Indeed, high-quality solutions often contain relevant knowledge that can be used to guide the heuristic towards promising areas. Learning from the structure of solutions is challenging in combinatorial problems. Most of the time, local optima are considered for this task since they tend to contain more relevant structural information. If local optima generally contain more interesting information than other solutions, producing them requires a time-consuming process. In this paper, we study the benefits of learning from local optima during the execution of a multi-objective algorithm. To this end, we consider a hybridized MOEA/D (a multi-objective genetic algorithm) with a knowledge discovery mechanism adapted to the problem solved and we conduct experiments on a bi-objective vehicle routing problem with time windows. The knowledge discovery mechanism extracts sequences of customers from solutions. The results show the benefit of using different strategies for the components of the knowledge discovery mechanism and the efficacy of extracting patterns from local optima for larger instances. An analysis of speed-up performance gives deeper conclusions about the use of local optima.
引用
收藏
页码:62 / 77
页数:16
相关论文
共 29 条
[1]  
[Anonymous], 2002, Local-search and hybrid evolutionary algorithms for Pareto optimization
[2]   PILS: Exploring high-order neighborhoods by pattern mining and injection [J].
Arnold, Florian ;
Santana, Italo ;
Sorensen, Kenneth ;
Vidal, Thibaut .
PATTERN RECOGNITION, 2021, 116
[3]   Knowledge-guided local search for the vehicle routing problem [J].
Arnold, Florian ;
Sorensen, Kenneth .
COMPUTERS & OPERATIONS RESEARCH, 2019, 105 :32-46
[4]   A hybrid data mining GRASP with path-relinking [J].
Barbalho, Hugo ;
Rosseti, Isabel ;
Martins, Simone L. ;
Plastino, Alexandre .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) :3159-3173
[5]   jMetalPy: A Python']Python framework for multi-objective optimization with metaheuristics [J].
Benitez-Hidalgo, Antonio ;
Nebro, Antonio J. ;
Garcia-Nieto, Jose ;
Oregi, Izaskun ;
Del Ser, Javier .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 51
[6]   Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation [J].
Blot, Aymeric ;
Kessaci, Marie-Eleonore ;
Jourdan, Laetitia .
JOURNAL OF HEURISTICS, 2018, 24 (06) :853-877
[7]  
Castro-Gutierrez J, 2011, IEEE SYS MAN CYBERN, P257, DOI 10.1109/ICSMC.2011.6083675
[8]  
Coello CAC, 2010, STUD COMPUT INTELL, V272, P1
[9]   Synergies between operations research and data mining: The emerging use of multi-objective approaches [J].
Corne, David ;
Dhaenens, Clarisse ;
Jourdan, Laetitia .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 221 (03) :469-479
[10]  
Dai HJ, 2017, ADV NEUR IN, V30