Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

C. Archetti, M. G. Speranza and A. Hertz
Transportation Science
Vol. 40, No. 1 (February 2006), pp. 64-73
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/25769283
Page Count: 10
  • More info
  • Cite this Item
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
64
    64
  • Thumbnail: Page 
65
    65
  • Thumbnail: Page 
66
    66
  • Thumbnail: Page 
67
    67
  • Thumbnail: Page 
68
    68
  • Thumbnail: Page 
69
    69
  • Thumbnail: Page 
70
    70
  • Thumbnail: Page 
71
    71
  • Thumbnail: Page 
72
    72
  • Thumbnail: Page 
73
    73