Author:
Souza Filipe,Grimes Diarmuid,O’Sullivan Barry
Abstract
AbstractLarge Neighbourhood Search (LNS) is a powerful technique that applies the “divide and conquer” principle to boost the performance of solvers on large scale Combinatorial Optimization Problems. In this paper we consider one of the main hindrances to the LNS popularity, namely the requirement of an expert to define a problem specific neighborhood. We present an approach that learns from problem structure and search performance in order to generate neighbourhoods that can match the performance of domain specific heuristics developed by an expert. Furthermore, we present a new objective function for the optimzation version of the Car Sequencing Problem, that better distinguishes solution quality.Empirical results on public instances demonstrate the effectiveness of our approach against both a domain specific heuristic and state-of-the-art generic approaches.
Publisher
Springer Nature Switzerland
Reference16 articles.
1. Lecture Notes in Computer Science;C Artigues,2014
2. Carchrae, T., Beck, J.C.: Cost-based large neighborhood search. In: Workshop on the Combination of Metaheuristic and Local Search with Constraint Programming Techniques (2005)
3. Freuder, E.C., O’Sullivan, B.: Grand challenges for constraint programming. In: Constraints, pp. 1–13 (2014). https://doi.org/10.1007/s10601-013-9155-1
4. Gecode Team: Gecode: Generic constraint development environment (2006). http://www.gecode.org
5. Habet, D., Terrioux, C.: Conflict history based heuristic for constraint satisfaction problem solving. J. Heuristics 27(6), 951–990 (2021). https://doi.org/10.1007/s10732-021-09475-z
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献