Article ID Journal Published Year Pages File Type
1143435 Operations Research Letters 2009 6 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows
Authors
, , ,