Two quasi-Newton methods are proposed to deal with traffic assignment in a capacitated network. The methods combine Newton formula, column generation, and penalty techniques. The first method uses the gradient of the objective function to obtain an improving feasible direction scaled by the second-order derivatives. The second one uses a Rosen gradient to obtain an improving direction scaled by the corresponding origin–destination demand. Both methods make a line search to obtain an optimal step size to guarantee the feasibility of either path or link flow. The proposed methods are of fast convergence and high accuracy at the expense of saving path information. Numerical examples verify their efficiency and stability. The quasi-Newton method with a straight gradient demonstrates more stability than the Rosen gradient for capacitated traffic assignment.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Alternative Quasi-Newton Methods for Capacitated User Equilibrium Assignment


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:
    Cheng, Lin (Autor:in) / Iida, Yasunori (Autor:in) / Uno, Nobuhiro (Autor:in) / Wang, Wei (Autor:in)


    Erscheinungsdatum :

    2003-01-01




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    An empirical comparison of alternative user equilibrium traffic assignment methods

    Slavin, H. / Brandon, J. / Rabinowicz, A. et al. | British Library Conference Proceedings | 2006



    Models and Properties of the Capacitated Network User Equilibrium

    Cheng, L. / Wang, W. / Beijing jiao tong da xue; Guo jia zi ran ke xue ji jin wei yuan hui (China); Wang Kuancheng jiao yu ji jin hui | British Library Conference Proceedings | 2006


    Travel Time Reliability Based on Sensitivity of Capacitated User Equilibrium Flow

    Cheng, L. / Iida, Y. / Uno, N. et al. | British Library Conference Proceedings | 2002