We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.
- Authors
Archetti, C.; Speranza, M. G.; Hertz, A.
- Abstract
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility of inserting a customer into a route without removing it from another route. The insertion of a customer into a route is done by means of the cheapest insertion method. Computational experiments are reported for a set of benchmark problems, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau.
- Subjects
ALGORITHMS; TRAFFIC engineering; DELIVERY of goods; BENCHMARKING (Management); BEST practices
- Publication
Transportation Science, 2006, Vol 40, Issue 1, p64
- ISSN
0041-1655
- Publication type
Article
- DOI
10.1287/trsc.1040.0103