Abstract We propose an algorithm to compute the optimum departure time and path for a commuter in a congested network. Constant costs for use of arcs, cost functions of travel time depending on exogenous congestion and schedule delay are taken into account. A best path for a given departure time is computed with a previous algorithm for the generalized shortest path problem. The globally optimal departure time and an optimal path are determined by adapting Piyavskii's algorithm to the case of one-sided Lipschitz functions.
Optimum departure times for commuters in congested networks
Annals of Operations Research ; 25 , 1 ; 279-290
1990-12-01
12 pages
Article (Journal)
Electronic Resource
English
DEPARTURE TIME CHOICE AND HETEROGENEITY OF COMMUTERS
British Library Conference Proceedings | 2003
|Commuters' Departure Time Decisions in Brussels, Belgium
Online Contents | 1997
|Commuters' Departure Time Decisions in Brussels, Belgium
British Library Conference Proceedings | 1997
|Commuters’ Departure Time Decisions in Brussels, Belgium
Transportation Research Record | 1997
|