IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v4y1996i2p225-256.html
   My bibliography  Save this article

A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks

Author

Listed:
  • L. Montero
  • J. Barceló

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:topjnl:v:4:y:1996:i:2:p:225-256
    DOI: 10.1007/BF02568510
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02568510
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02568510?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Smith, M. J., 1983. "An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function," Transportation Research Part B: Methodological, Elsevier, vol. 17(5), pages 365-371, October.
    2. Smith, M. J., 1981. "Properties of a traffic control policy which ensure the existence of a traffic equilibrium consistent with the policy," Transportation Research Part B: Methodological, Elsevier, vol. 15(6), pages 453-462, December.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. García, Ricardo & Marín, Angel, 2005. "Network equilibrium with combined modes: models and solution algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 223-254, March.
    2. Jaume Barceló, 1997. "A survey of some mathematical programming models in transportation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 1-40, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Yu, Hao & Ma, Rui & Zhang, H. Michael, 2018. "Optimal traffic signal control under dynamic user equilibrium and link constraints in a general network," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 302-325.
    6. Claudio Meneguzzer, 1998. "Stochastic user equilibrium assignment with traffic-responsive signal control," ERSA conference papers ersa98p337, European Regional Science Association.
    7. 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.
    8. Chen, Yuh-Wen & Tzeng, Gwo-Hshiung, 2001. "Using fuzzy integral for evaluating subjectively perceived travel costs in a traffic assignment model," European Journal of Operational Research, Elsevier, vol. 130(3), pages 653-664, May.
    9. Lee, Seunghyeon & Wong, S.C. & Varaiya, Pravin, 2017. "Group-based hierarchical adaptive traffic-signal control part I: Formulation," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 1-18.
    10. 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.
    11. 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.
    12. Xie, Chi & Travis Waller, S., 2012. "Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1023-1042.
    13. Guo, Jianhua & Kong, Ye & Li, Zongzhi & Huang, Wei & Cao, Jinde & Wei, Yun, 2019. "A model and genetic algorithm for area-wide intersection signal optimization under user equilibrium traffic," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 155(C), pages 92-104.
    14. C Fisk, 1984. "A Nonlinear Equation Framework for Solving Network Equilibrium Problems," Environment and Planning A, , vol. 16(1), pages 67-80, January.
    15. Robert B. Dial, 1999. "Network-Optimized Road Pricing: Part II: Algorithms and Examples," Operations Research, INFORMS, vol. 47(2), pages 327-336, April.
    16. David Levinson & Ajay Kumar, 1994. "Integrating Feedback into the Transportation Planning Mode," Working Papers 199404, University of Minnesota: Nexus Research Group.
    17. Evers, Ruth & Proost, Stef, 2015. "Optimizing intersections," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 100-119.
    18. D’Acierno, Luca & Gallo, Mariano & Montella, Bruno, 2012. "An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem," European Journal of Operational Research, Elsevier, vol. 217(2), pages 459-469.
    19. Watling, David, 1996. "Asymmetric problems and stochastic process models of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 339-357, October.
    20. 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.

    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:spr:topjnl:v:4:y:1996:i:2:p:225-256. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.