Combining Meta-Heuristics to Effectively Solvethe Vehicle Routing Problems with Time Windows

Authors:
Vincent Tam;K. T. Ma
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong (E-mail: vtam@eee.hku.hk);Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 (Currently at Heuristix Lab Pte Ltd., Singapore/ E-mail: kengteck@heulab.com
Venue:
Artificial Intelligence Review
Year:
2004

Citing 5
Cited 0

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

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
Constrained genetic algorithms and their applications in nonlinear constrained optimization

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problemswith time windows are challenging deliveryproblems in which instances involving 100customers or more can be difficult to solve.There were many interesting heuristics proposedto handle these problems effectively. In thispaper, we examined two well-knownmeta-heuristics and carefully combined theshort-term and long-term memory-like mechanismsof both methods to achieve better results. Ourprototype was shown to compare favorablyagainst the original search methods and otherrelated search hybrids on the Solomon's testcases. More importantly, our proposal ofintegration opens up many exciting directionsfor further investigation.