Route Construction Algorithms for Time Dependent Vehicle Routing Problem

Time Dependent Vehicle Routing Problem (TDVRP) is to study the problem of vehicle routing optimization in dynamic network with fluctuant link travel time. Route construction algorithms are fast and flexible, which have been deeply studied in traditional Vehicle Routing Problem (VRP). But traditional route construction algorithms couldn't be directly applied to TDVRP. In this paper, the authors gave a mixed-integer programming model for TDVRP, and extended traditional construction algorithms to TDVRP. The authors compared these algorithms with a Nearest Neighbor algorithm which was proposed by Malandraki (1992), then analyzed how the characteristics of test problems impact the performance of algorithms.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 3464-3471
  • Monograph Title: ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration

Subject/Index Terms

Filing Info

  • Accession Number: 01525717
  • Record Type: Publication
  • ISBN: 9780784411391
  • Files: TRIS, ASCE
  • Created Date: Nov 12 2013 1:53PM