A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem

Anna Franceschetti (), Dorothée Honhon (), Gilbert Laporte () and Tom Van Woensel ()
Additional contact information
Anna Franceschetti: Distribution Management, HEC Montréal, Montréal, Québec H3T 2A7, Canada
Dorothée Honhon: Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080
Gilbert Laporte: Distribution Management, HEC Montréal, Montréal, Québec H3T 2A7, Canada
Tom Van Woensel: School of Industrial Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands

Transportation Science, 2018, vol. 52, issue 4, 756-768

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.

Keywords: speed optimization; shortest path; scheduling (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1287/trsc.2018.0820 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:52:y:2018:i:4:p:756-768

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().