A new optimization algorithm for the vehicle routing problem with time windows
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
A tabu search heuristic for the vehicle routing problem
Management Science
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
SALSA: A Language for Search Algorithms
Constraints
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
Journal of Heuristics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Local Probing Applied to Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
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
Hybrid algorithms in constraint programming
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Hi-index | 0.00 |
This paper presents a heuristic for solving very large routing problems (thousands of customers and hundreds of vehicles) with side constraints such as time windows. When applied to traditional benchmarks (Solomon‘s), we obtain high quality results with short resolution time (a few seconds). We also introduce a LDS (Limited Discrepancy Search) variation that produces state-of-the-art results. The heart of this heuristic is a combination of a look-ahead insertion algorithm, anincremental local optimization scheme and a constraint solver for constrained traveling salesman problems. The incrementality means that instead of visiting some large neighborhood after an initial solution has been found, a limited number of moves is examined, after each insertion, on the partial solution. This incremental version is not only faster, it also yields better results than using local optimization once a full solution has been built. We also show how additional constraints can be used inorder to guide the insertion process. Because of its use of separate CP (Constraint Programming) modules, this method is flexible and may be used to solve large dispatching problems that include many additional constraints such as setup times (asymmetrical distance) or skill matching.