A Comparison of Traditional and Constraint-based HeuristicMethods on Vehicle Routing Problems with Side Constraints

Authors:
Philip Kilby;Patrick Prosser;Paul Shaw
Affiliations:
CSIRO MIS, GPO Box 664, Canberra ACT 2601, Australia;Department of Computer Science, University of Strathclyde, Glasgow, Scotland;ILOG S.A., BP 85, 9 rue de Verdun, 94253 Gentilly Cedex, France
Venue:
Constraints
Year:
2000

Citing 8
Cited 9

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

Operations Research
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Algorithms for the vehicle routing problems with time deadlines

American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
Tabu Search

Tabu Search
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Transportation Science
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Limited discrepancy search

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

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
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 Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
Vehicle Scheduling and Routing with Drivers' Working Hours

Transportation Science
Scheduler-oriented algorithms to improve human-machine cooperation in transportation scheduling support systems

Engineering Applications of Artificial Intelligence
Agent-based guided local search

Expert Systems with Applications: An International Journal
Group-based ant colony optimization

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem (VRP) is a variantof the familiar travelling salesperson problem (TSP). In theVRP we are to perform a number of visits, using a number of vehiclesof limited capacity, while typically minimizing the distancetravelled. VRPs can be complicated by imposing time windows ordeadlines on visits, sequencing constraints between visits, andso on. In this paper, we use a constraint-based toolkit for solvingvehicle routing problems to study the effect of different heuristictechniques. We investigate the performance of a number of constructionand improvement techniques, and show that as the size of thesolution space is decreased through addition of side constraints,certain conventional techniques fail while constraint directedtechniques continue to perform acceptably. This suggests thatconstraint programming techniques are particularly suited toVRPs with side constraints.