A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

In this paper we deal with a generalization of the Vehicle Routing Problem with Time Windows that considers time-dependent travel times and costs. Through several steps we transform this extension into an Asymmetric Capacitated Vehicle Routing Problem, so it can be solved both optimally and heuristically with known codes. © 2008 Elsevier B.V. All rights reserved.

https://doi.org/10.1016/j.orl.2008.07.007

Cite as:

@article{Soler_2009,
	doi = {10.1016/j.orl.2008.07.007},
	url = {https://doi.org/10.1016%2Fj.orl.2008.07.007},
	year = 2009,
	month = {jan},
	publisher = {Elsevier {BV}},
	volume = {37},
	number = {1},
	pages = {37--42},
	author = {David Soler and Jos{'{e}} Albiach and Eulalia Mart{'{i}}nez},
	title = {A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows},
	journal = {Operations Research Letters}
}