Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 48, Issue 1, Pages 248-257Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2011.07.001
Keywords
Vehicle routing with time windows; Logistics; Time geography; Spatiotemporal distance
Ask authors/readers for more resources
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. (C) 2011 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available