TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMANDS AND CUSTOMERS - REVISED EDITION

This paper considers a version of the stochastic vehicle routing problem where customers are present with some probality and have random demands. A tabu search heuristic is developed for this problem. Comparisons with known optimal solutions indicate that the heuristic solves the problem to optimality in the vast majority of cases and deviations from optimality are almost always smamll.

• 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:
  • Gendreau, M
  • Seguin, R
  • Laporte, G
• Publication Date: 1995

Language

• English

Media Info

• Pagination: 27 p.

Subject/Index Terms

• TRT Terms: Automated vehicle control; Heuristic methods; Optimization; Routing; Stochastic processes
• Old TRIS Terms: Searching
• Subject Areas: Data and Information Technology; Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

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