A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
A tabu search heuristic for the vehicle routing problem
Management Science
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
Proceedings of the 2002 ACM symposium on Applied computing
Guided Local Search — an Illustrative Example in Function Optimisation
BT Technology Journal
Engineering Dynamic Scheduler for Work Manager
BT Technology Journal
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
Meta-heuristics: The State of the Art
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Manpower scheduling with time windows
Proceedings of the 2003 ACM symposium on Applied computing
Combining Meta-Heuristics to Effectively Solvethe Vehicle Routing Problems with Time Windows
Artificial Intelligence Review
Control Abstractions for Local Search
Constraints
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
Vehicle routing problem with elementary shortest path based column generation
Computers and Operations Research
A case study of mutual routing-scheduling reformulation
Journal of Scheduling
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Fuzzy measure on vehicle routing problem of hospital materials
Expert Systems with Applications: An International Journal
A hybrid algorithm for vehicle routing problem with time windows
Expert Systems with Applications: An International Journal
Analytics-driven asset management
IBM Journal of Research and Development
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
An agent-based guided local search for the capacited vehicle routing problem
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Engineering Applications of Artificial Intelligence
Agent-based guided local search
Expert Systems with Applications: An International Journal
Resolving single depot vehicle routing problem with artificial fish swarm algorithm
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
Hi-index | 0.00 |
Constraint Programming typically uses the technique of depth-first branch and bound as the method of solving optimization problems. Although this method can give the optimal solution, for large problems, the time needed to find the optimal can be prohibitive. This paper introduces a method for using local search techniques within a Constraint Programming framework, and applies this technique to vehicle routing problems. We introduce a Constraint Programming model for vehicle routing, and a system for integrating Constraint Programming and local search techniques. We then describe how the method can be accelerated by handling core constraints using fast local checks, while other more complex constraints are left to the constraint propagation system. We have coupled our local search method with a meta-heuristic to avoid the search being trapped in local minima. Several meta-heuristics are investigated ranging from a simple Tabu Search method to Guided Local Search. An empirical study over benchmark problems shows the relative merits of these techniques. Investigations indicate that the specific long-term memory technique used by Guided Local Search can be used as a diversification method for Tabu Search, resulting in significant benefit. Several new best solutions on the Solomon problems are found in relatively few iterations of our algorithm.