Franceschetti, A.Honhon, DorothéeLaporte, G.Van Woensel, T.2019-06-182019-06-182018-05-140041-1655https://hdl.handle.net/10735.1/6599Full text access from Treasures at UT Dallas is restricted to current UTD affiliates.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.en©2018 INFORMSSchedulingSpeed zoning (Traffic engineering)Cost effectivenessTraffic congestionGraph theoryarticleFranceschetti, A., D. Honhon, G. Laporte, and T. Van Woensel. 2018. "A shortest-path algorithm for the departure time and speed optimization problem." Transportation Science 52(4): 756-768, doi:10.1287/trsc.2018.0820524