Optimum departure times for commuters in congested networks (Q2277160)

A mathematical model for a commuter to find his optimum departure time and path in a congested network is presented, in which the objective function is the sum of the fixed costs for use of arcs, cost functions of travel time depending on exogenous congestion and schedule delay. It can be shown that this problem is NP-hard. This paper presents an algorithm for solving the problem. The idea of the algorithm is based on the generalized shortest path algorithm given by the authors and \textit{M. Labbé} [Transp. Sci. 24, No.4, 276-286 (1990; Zbl 0724.90075)] and an algorithm of \textit{S. A. Piyavskij} [U.S.S.R. Comput. Math. Math. Phys. 12 (1972), No.4, 57-67 (1973); translation from Zh. Vychisl. Mat. Mat. Fiz. 12, 888-896 (1972; Zbl 0249.65046)] for the case of a one-sided Lipschitz function.