The Time Dependent Vehicle Routing Problem with Time Windows: Benchmark Problems, an Efficient Solution Algorithm, and Solution Characteristics
Published In
Transportation Research Part E: Logistics and Transportation Review
Document Type
Citation
Publication Date
5-2012
Subjects
Vehicle routing, Benchmark problems, Time dependent travel time, Variable speed, Congestion
Abstract
An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers squared. New replicable test problems that capture the typical speed variations of congested urban settings are proposed. Solution quality, time window perturbations, and computational time results are discussed as well as a method to study the impact of perturbations by problem type. The algorithm efficiency and simplicity is well suited for urban areas where fast running times may be required.
Rights
Copyright 2012 Elsevier Ltd. All rights reserved.
Locate the Document
DOI
10.1016/j.tre.2011.11.006
Persistent Identifier
http://archives.pdx.edu/ds/psu/20830
Citation Details
Figliozzi, Miguel, "The Time Dependent Vehicle Routing Problem with Time Windows: Benchmark Problems, an Efficient Solution Algorithm, and Solution Characteristics" (2012). Civil and Environmental Engineering Faculty Publications and Presentations. 279.
http://archives.pdx.edu/ds/psu/20830