The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information

H. Ben Ticha, Nabil Absi, Dominique Feillet (Corresponding author), Alain Quilliot, Tom van Woensel

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

Most time-dependent vehicle routing problems are based on a similar modeling paradigm: travel time information is represented by travel time functions between pairs of points of interest (e.g., depot or customers). Only a few papers investigate how these functions can be computed using the available travel time information. Furthermore, most of them neglect the possibility that different paths could be selected in the road network depending on the compromises they offer between cost (distance) and travel time. In this paper, we propose a new setting where travel time functions are defined on road-network arcs. We consider the Time-Dependent Vehicle Routing Problem with Time Windows and solve it with a branch-and-price algorithm. As far as we know, this is the first exact approach for a time-dependent vehicle routing problem when travel time functions are initially defined on the segments of a road-network.
Original languageEnglish
Article number4
Number of pages25
JournalSN Operations Research Forum
Volume2
DOIs
Publication statusPublished - 8 Jan 2021

Fingerprint Dive into the research topics of 'The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information'. Together they form a unique fingerprint.

Cite this