A variable neighbourhood search combining constraint programming and Lagrangean relaxation for solving routing problems

Authors:
Rosa Herrero;Daniel Guimarans;Juan José Ramos;Silvia Padrón
Affiliations:
Universitat Autònoma de Barcelona, Spain;Universitat Autònoma de Barcelona, Spain;Universitat Autònoma de Barcelona, Spain;Universitat Autònoma de Barcelona, Spain
Venue:
Proceedings of the 2010 Summer Computer Simulation Conference
Year:
2010

Citing 8
Cited 0

Variable neighborhood search

Computers and Operations Research
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

Journal of Heuristics
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
Constraint Logic Programming using Eclipse

Constraint Logic Programming using Eclipse
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm's efficiency. The complete problem is decomposed into two separated submodels, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial solution which is rapidly improved by means of metaheuristics' iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure, in order to ensure constraints satisfaction and to reduce the calculation burden. Remarkable results have been obtained using this methodology, including a new best-known solution for a rarely solved 200-customers test instance and a better alternative solution for another benchmark problem.