Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

Authors:
Louis-Martin Rousseau;Michel Gendreau;Gilles Pesant
Affiliations:
Dé/partement informatique et recherche opé/rationnelle, University of Montreal, C.P. 6128 Succ. Centre-Ville, Montré/al, Canada, H3C 3J7&semi/ Centre for Research on Transportation, Un ...;Dé/partement informatique et recherche opé/rationnelle, University of Montreal, C.P. 6128 Succ. Centre-Ville, Montré/al, Canada, H3C 3J7&semi/ Centre for Research on Transportation, Un ...;Dé/partement de gé/nie é/lectrique et de gé/nie informatique, É/cole Polytechnique de Montré/al, C.P. 6079 Succ. Centre-Ville, Montré/al, Canada, H3C 3A7&semi/ Centre f ...
Venue:
Journal of Heuristics
Year:
2002

Citing 11
Cited 21

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
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
Variable neighborhood search

Computers and Operations Research
The OPL optimization programming language

The OPL optimization programming language
A Constraint Programming Framework for Local Search Methods

Journal of Heuristics
Heuristics for Large Constrained Vehicle Routing Problems

Journal of Heuristics
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

Operations Research
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Transportation Science
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Local search with annealing-like restarts to solve the vehicle routing problem with time windows

Proceedings of the 2002 ACM symposium on Applied computing
Manpower scheduling with time windows

Proceedings of the 2003 ACM symposium on Applied computing
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

Applied Intelligence
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

Computational Optimization and Applications
A unified framework for partial and hybrid search methods in constraint programming

Computers and Operations Research
The vehicle routing problem with flexible time windows and traveling times

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
A framework for constructing complete algorithms based on local search

AI Communications - Constraint Programming for Planning and Scheduling
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Journal of Heuristics
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows

IEEE Transactions on Evolutionary Computation
A large neighbourhood search approach to the multi-activity shift scheduling problem

Journal of Heuristics
A hybrid algorithm for vehicle routing problem with time windows

Expert Systems with Applications: An International Journal
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A variable neighbourhood search combining constraint programming and Lagrangean relaxation for solving routing problems

Proceedings of the 2010 Summer Computer Simulation Conference
Local search heuristics for robotic routing planner

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Transportation Science
Nondeterministic control for hybrid search

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint programming which allow an efficient search of such neighborhoods. The advantages of using a large neighborhood are not only the increased probability of finding a better solution at each iteration but also the reduction of the need to invoke specially-designed methods to avoid local minima. These operators are combined in a variable neighborhood descent in order to take advantage of the different neighborhood structures they generate.