Affordable Access

Publisher Website

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

Authors
Journal
Operations Research Letters
0167-6377
Publisher
Elsevier
Publication Date
Volume
37
Issue
1
Identifiers
DOI: 10.1016/j.orl.2008.07.007
Keywords
  • Vehicle Routing
  • Time Window
  • Time-Dependent Costs

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.