A shortest-path algorithm for the departure time and speed optimization problem

Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel

Research output: Contribution to journalArticlepeer-review

11 Citations (SciVal)

Abstract

We present a shortest-path algorithm for the departure time and speed optimization problem under traffic congestion. The objective of the problem is to determine an optimal schedule for a vehicle visiting a fixed sequence of customer locations to minimize a total cost function encompassing emissions cost and labor cost.We account for the presence of traffic congestion, which limits the vehicle speed during peak hours.We show how to cast this problem as a shortest-path problem by exploiting some structural results of the optimal solution. We illustrate the solution method and discuss some properties of the problem.

Original languageEnglish
Pages (from-to)756-768
Number of pages13
JournalTransportation Science
Volume52
Issue number4
DOIs
Publication statusPublished - 1 Jul 2018

Funding

Funding: This work was partly supported by the Dutch Institute for Advanced Logistics under [project 4C4D] and by the Canadian Natural Sciences and Engineering Research Council under [Grant 2015-06189]. This support is gratefully acknowledged. SupplementalMaterial: The online appendix is available at https://doi.org/10.1287/trsc.2018.0820.

Keywords

  • Scheduling
  • Shortest path
  • Speed optimization

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Fingerprint

Dive into the research topics of 'A shortest-path algorithm for the departure time and speed optimization problem'. Together they form a unique fingerprint.

Cite this