Constraint-based Very Large-Scale Neighborhood search

Authors:
Sébastien Mouthuy;Pascal Van Hentenryck;Yves Deville
Affiliations:
Department of Computing Science and Engineering, Université catholique de Louvain, Louvain-la-Neuve, Belgium 1348;Brown University, Providence, USA 02912;Department of Computing Science and Engineering, Université catholique de Louvain, Louvain-la-Neuve, Belgium 1348
Venue:
Constraints
Year:
2012

Citing 15
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
The Travelling Salesman and the Pq-Tree

Mathematics of Operations Research
New methods to color the vertices of a graph

Communications of the ACM
Recent Developments in Practical Examination Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Constraint-Based Local Search

Constraint-Based Local Search
New approaches for solving the block-to-train assignment problem

Networks - Special Issue In Memory of Stefano Pallottino
On teleprocessing system design: part II a method for approximating the optimal network

IBM Systems Journal
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Characterization and automation of matching-based neighborhoods

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem

Discrete Optimization
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions to complex optimization problems efficiently. However, so far, VLSN algorithms are essentially described and implemented in terms of low-level implementation concepts, preventing code reuse and extensibility which are trademarks of constraint-programming systems. This paper aims at remedying this limitation and proposes a constraint-based VLSN (CBVLSN) framework to describe VLSNs declaratively and compositionally. Its main innovations are the concepts of cycle-consistent MoveGraphs and compositional moves which make it possible to specify an application in terms of constraints and objectives and to derive a dedicated VLSN algorithm automatically. The constraint-based VLSN framework has been prototyped in COMET and its efficiency is shown to be comparable to dedicated implementations.