Link capacity side constraints are explicitly incorporated into the variational inequality-based dynamic user-optimal route choice problem. The corresponding dynamic capacitated user-optimal conditions for each origin-destination pair and time interval state that the generalized route travel times (composed of route travel times and queuing delays) experienced by travelers are equal and minimal. An augmented Lagrangian dual method that embeds the gradient projection algorithm is then proposed and validated with a numerical example. The computational performance of the gradient projection algorithm is also compared with the disaggregate simplicial decomposition algorithm in a preliminary attempt.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic Capacitated User-Optimal Route Choice Problem


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    1999-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic Capacitated User-Optimal Route Choice Problem

    Chen, Huey-Kuo | Online Contents | 1999


    Dynamic Capacitated User-Optimal Route Choice Problem

    Chen, H.-K. / Wang, C.-Y. / National Research Council | British Library Conference Proceedings | 1999



    Comparison of Link-Based Versus Route-Based Algorithms in the Dynamic User-Optimal Route Choice Problem

    Chen, H.-K. / Chang, C.-W. / Chang, M.-S. et al. | British Library Conference Proceedings | 1999


    Comparison of Link-Based Versus Route-Based Algorithms in the Dynamic User-Optimal Route Choice Problem

    Chen, Huey-Kuo / Chang, Chia-Wei / Chang, Mei-Shiang | Transportation Research Record | 1999