A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows

Mingyao Qi, Wei Hua Lin, Nan Li, Lixin Miao

Research output: Contribution to journalArticle

22 Scopus citations


For VRP with time windows (VRPTW) solved by conventional cluster-first and route-second approach, temporal information is usually considered with vehicle routing but ignored in the process of clustering. We propose an alternative approach based on spatiotemporal partitioning to solving a large-scale VRPTW, considering jointly the temporal and spatial information for vehicle routing. A spatiotemporal representation for the VRPTW is presented that measures the spatiotemporal distance between two customers. The resulting formulation is then solved by a genetic algorithm developed for k-medoid clustering of large-scale customers based on the spatiotemporal distance. The proposed approach showed promise in handling large scale networks.

Original languageEnglish (US)
Pages (from-to)248-257
Number of pages10
JournalTransportation Research Part E: Logistics and Transportation Review
Issue number1
StatePublished - Jan 2012



  • Logistics
  • Spatiotemporal distance
  • Time geography
  • Vehicle routing with time windows

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Cite this