VEHICLE ROUTING WITH MULTIPLE USE OF VEHICLES

The vehicle routing problem is a central problem in distribution management. A variant of the standard problem with multiple use of vehicles involves the same vehicle being assigned to several routes during a given planning period. This paper develops a tabu search heuristic for this variant problem. The algorithm and computational results on a series of test problems are presented.

  • Corporate Authors:

    University of Montreal

    Center for Research on Transportation (CRT)/CIRRELT
    P.O. Box 6128, Station Centre-ville
    Montreal, Quebec  Canada  H3C 3J7
  • Authors:
    • Taillard, E D
    • Gendreau, M
    • Laporte, G
  • Publication Date: 1995

Language

  • English

Media Info

  • Pagination: 15 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00719130
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 16 1996 12:00AM