IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v16y1982i3p361-381.html
   My bibliography  Save this article

Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs

Author

Listed:
  • Caroline Fisk

    (Université de Montréal, Montréal, Quebec)

  • Sang Nguyen

    (Université de Montréal, Montréal, Quebec)

Abstract

We consider algorithms proposed for solving the fixed demand user optimized network equilibrium problem with asymmetric user costs. Because the Jacobian matrix for the costs is asymmetric, no known equivalent convex optimization problem exists and alternative solution methods to nonlinear programming techniques must be sought. The purpose of this paper is to compare the performance of several existing methods for determining the equilibrium network flows of a small realistic network model in which intersection controls are incorporated which lead to particularly asymmetric cost functions.

Suggested Citation

  • Caroline Fisk & Sang Nguyen, 1982. "Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs," Transportation Science, INFORMS, vol. 16(3), pages 361-381, August.
    • Handle: RePEc:inm:ortrsc:v:16:y:1982:i:3:p:361-381
    DOI: 10.1287/trsc.16.3.361
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.16.3.361
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.16.3.361?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. C Fisk, 1984. "A Nonlinear Equation Framework for Solving Network Equilibrium Problems," Environment and Planning A, , vol. 16(1), pages 67-80, January.
    2. Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
    3. Castillo González, Rodrigo & Clempner, Julio B. & Poznyak, Alexander S., 2019. "Solving traffic queues at controlled-signalized intersections in continuous-time Markov games," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 166(C), pages 283-297.
    4. Ennio Cascetta & Mariano Gallo & Bruno Montella, 2006. "Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models," Annals of Operations Research, Springer, vol. 144(1), pages 301-328, April.
    5. Lam, William H. K. & Tam, M. L., 1997. "Why standard modelling and evaluation procedures are inadequate for assessing traffic congestion measures," Transport Policy, Elsevier, vol. 4(4), pages 217-223, October.
    6. L. Montero & J. Barceló, 1996. "A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(2), pages 225-256, December.
    7. Joaquín De Cea & J. Enrique Fernández & Valérie Dekock & Alexandra Soto, 2004. "Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes," Transport Reviews, Taylor & Francis Journals, vol. 25(3), pages 293-317, January.
    8. V. Ruggiero & L. Zanni, 2000. "A Modified Projection Algorithm for Large Strictly-Convex Quadratic Programs," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 255-279, February.
    9. Louis de Grange & Juan Carlos Muñoz, 2007. "An equivalent optimization formulation for the traffic assignment problem with asymmetric linear costs," Transportation Planning and Technology, Taylor & Francis Journals, vol. 32(1), pages 1-25, March.
    10. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:16:y:1982:i:3:p:361-381. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.