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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimum departure times for commuters in congested networks


    Contributors:

    Published in:

    Publication date :

    1990-12-01


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    DEPARTURE TIME CHOICE AND HETEROGENEITY OF COMMUTERS

    de Palma, A. / Fontan, C. / World Conference on Transport Research Society | British Library Conference Proceedings | 2003


    Commuters' Departure Time Decisions in Brussels, Belgium

    Palma, André de | Online Contents | 1997


    Commuters' Departure Time Decisions in Brussels, Belgium

    De Palma, A. / Khattak, A. J. / Gupta, D. et al. | British Library Conference Proceedings | 1997


    Commuters’ Departure Time Decisions in Brussels, Belgium

    De Palma, André / Khattak, Asad J. / Gupta, Deepak | Transportation Research Record | 1997


    Statistical analysis of commuters' route, mode, and departure time flexibility

    Mannering, Fred / Kim, Soon-Gwan / Barfield, Woodrow et al. | Elsevier | 1994