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

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

0.00 Avg rating0 Votes
Article ID: iaor20102915
Volume: 37
Issue: 1
Start Page Number: 37
End Page Number: 42
Publication Date: Jan 2009
Journal: Operations Research Letters
Authors: , ,
Keywords: vehicle routing & scheduling
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.

Reviews

Required fields are marked *. Your email address will not be published.