Probabilistic vehicle routing and scheduling based on probe vehicle data

This paper presents the Probabilistic Vehicle Routing and scheduling Problem with Time Windows (VRPTW-P) model which takes into account the uncertainty of travel times. Probe vehicle data of travel times were obtained from actual operation of pickup-delivery truck in Osaka-Kobe area. The optimal solution of VRPTW-P resulted in considerably reducing total cost, travel times and CO2, NOx and SPM emissions compared with expected average case based on the real operation. This is attributed to better routing of VRPTW-P to choose more reliable roads. Therefore, VRPTW-P can contribute to establish efficient an environmentally friendly delivery systems in urban area.

  • Authors:
    • TANIGUCHI, E
    • ANDO, N
  • Publication Date: 2008

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01109493
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD
  • Created Date: Aug 25 2008 8:30AM