Annals of Operations Research

, Volume 41, Issue 4, pp 421–451

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

  • Ibrahim Hassan Osman
Various Applications

DOI: 10.1007/BF02023004

Cite this article as:
Osman, I.H. Ann Oper Res (1993) 41: 421. doi:10.1007/BF02023004

Abstract

The vehicle routing problem (VRP) under capacity and distance restrictions involves the design of a set of minimum cost delivery routes, originating and terminating at a central depot, which services a set of customers. Each customer must be supplied exactly once by one vehicle route. The total demand of any vehicle must not exceed the vehicle capacity. The total length of any route must not exceed a pre-specified bound. Approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated. A special data structure for the tabu search algorithm is implemented which has reduced notably the computational time by more than 50%. An estimate for the tabu list size is statistically derived. Computational results are reported on a sample of seventeen bench-mark test problems from the literature and nine randomly generated problems. The new methods improve significantly both the number of vehicles used and the total distances travelled on all results reported in the literature.

Keywords

Local search approximate algorithms heuristics hybrid algorithms simulated annealing tabu search vehicle routing problem 

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • Ibrahim Hassan Osman
    • 1
  1. 1.Institute of Mathematics and StatisticsThe UniversityCanterburyUK

Personalised recommendations