The standard traffic assignment problem (TAP) is often augmented with additional constraints to address non-standard applications. These models are called TAP with side constraints (TAPSC). Despite the rising significance of TAPSC models, the ability to efficiently solve them to satisfactory precision remains limited in real-world applications. The purpose of this paper is to fill this gap by integrating a recently developed high performance TAP solver, known as the path-based Greedy algorithm, with the augmented Lagrangian multiplier (ALM) method. This paper examines how precisely the subproblems in the ALM method should be solved to optimize the overall convergence performance. It is found that insufficiently converged subproblem solutions sometimes lead to catastrophic failures, although pursuing extremely high precision could also be counterproductive. Accordingly, it is proposed to adjust the precision required to solve the subproblems based on an approximate gap measured by the augmented Lagrangian. Results of numerical experiments show that adaptively adjusting the subproblem precision limit produces a 25% speed-up compared with the algorithm with a fixed limit.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Efficient Algorithm for the Traffic Assignment Problem with Side Constraints


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:
    Feng, Liyang (Autor:in) / Xie, Jun (Autor:in) / Nie, Yu (Marco) (Autor:in) / Liu, Xiaobo (Autor:in)


    Erscheinungsdatum :

    2020-03-03




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    An Efficient Algorithm for a Bicriterion Traffic Assignment Problem

    Marcotte, P. / Zhu, D. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996


    Gradient Projection Algorithm for Side-constrained Traffic Assignment

    Joseph N. Prashker / Tomer Toledo | DOAJ | 2004

    Freier Zugriff


    Origin-Based Algorithm for the Traffic Assignment Problem

    Bar-Gera, H. | British Library Online Contents | 2002


    Origin-Based Algorithm for the Traffic Assignment Problem

    Bar-Gera, Hillel | Online Contents | 2002