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. © 2011 Elsevier Ltd.
https://doi.org/10.1016/j.tre.2011.11.006Cite as:
@article{Andres_Figliozzi_2012,
doi = {10.1016/j.tre.2011.11.006},
url = {https://doi.org/10.1016%2Fj.tre.2011.11.006},
year = 2012,
month = {may},
publisher = {Elsevier {BV}},
volume = {48},
number = {3},
pages = {616--636},
author = {Miguel Andres Figliozzi},
title = {The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics},
journal = {Transportation Research Part E: Logistics and Transportation Review}
}