Abstract An incremental heuristic is presented for estimating the departure rate of commuters in a network. Other results that can be obtained from the model include time-dependent flows of traffic and travel times for each link in the network. The model is able to handle multiple origin-destination pairs in a complex network. The size of the network it can handle is only limited by the size of the memory of the computer and available computer time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Departure rate and route assignment of commuter traffic during peak period


    Contributors:

    Published in:

    Publication date :

    1988-11-29


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic commuter departure time choice under uncertainty

    Jou, Rong-Chang / Kitamura, Ryuichi / Weng, Mei-Chuan et al. | Elsevier | 2008


    An analysis of the commuter departure time decision

    Abkowitz, Mark D. | Online Contents | 1981



    BRAESS'S PARADOXES IN DYNAMIC TRAFFIC ASSIGNMENT WITH SIMULTANEOUS DEPARTURE TIME AND ROUTE CHOICES

    Zhang, Xiaoning / Lam, William H.K. / Huang, Hai-Jun | Taylor & Francis Verlag | 2008