IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v18y1984i2p123-133.html
   My bibliography  Save this article

Simplical decomposition of the asymmetric traffic assignment problem

Author

Listed:
  • Lawphongpanich, Siriphong
  • Hearn, Donald W.

Abstract

This paper presents a convergent simplicial decomposition algorithm for the variational inequality formulation of the asymmetric traffic assignment problem. It alternates between generating minimum path trees based on the cost function evaluated at the current iterate and the approximate solving of a master variational inequality subject to simple convexity constraints. Thus it generalizes the popular Frank-Wolfe method (where the master problem is a line search) to the asymmetric problem. Rules are given for dropping flow patterns which are not needed to express the current iterate as a convex combination of previous patterns. The results of some computational testing are reported.

Suggested Citation

  • Lawphongpanich, Siriphong & Hearn, Donald W., 1984. "Simplical decomposition of the asymmetric traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 123-133, April.
    • Handle: RePEc:eee:transb:v:18:y:1984:i:2:p:123-133
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(84)90026-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    2. 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.
    3. Timilehin Opeyemi Alakoya & Oluwatosin Temitope Mewomo, 2024. "Strong Convergent Inertial Two-subgradient Extragradient Method for Finding Minimum-norm Solutions of Variational Inequality Problems," Networks and Spatial Economics, Springer, vol. 24(2), pages 425-459, June.
    4. Shipra Singh & Savin Treanţă, 2021. "Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis," Annals of Operations Research, Springer, vol. 302(1), pages 265-287, July.
    5. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    6. Patrice Marcotte & Sang Nguyen & Alexandre Schoeb, 2004. "A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks," Operations Research, INFORMS, vol. 52(2), pages 191-212, April.
    7. W. Chung & J. Fuller & Y. Wu, 2003. "A New Demand-Supply Decomposition Method for a Class of Economic Equilibrium Models," Computational Economics, Springer;Society for Computational Economics, vol. 21(3), pages 231-243, June.
    8. Walter C. Labys & Chin-wei Yang, 1991. "Advances in the Spatial Equilibrium Modeling of Mineral and Energy Issues," International Regional Science Review, , vol. 14(1), pages 61-94, April.
    9. J. H. Wu, 1997. "Modified Primal Path-Following Scheme for the Monotone Variational Inequality Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(1), pages 189-208, October.
    10. Robert B. Dial, 1999. "Network-Optimized Road Pricing: Part II: Algorithms and Examples," Operations Research, INFORMS, vol. 47(2), pages 327-336, April.
    11. Fuller, J. David & Chung, William, 2008. "Benders decomposition for a class of variational inequalities," European Journal of Operational Research, Elsevier, vol. 185(1), pages 76-91, February.
    12. 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.
    13. William Chung & J. D. Fuller & Y. June Wu, 2006. "A New Decomposition Method for Multiregional Economic Equilibrium Models," Operations Research, INFORMS, vol. 54(4), pages 643-655, August.
    14. Takashi Akamatsu, 2001. "An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues," Transportation Science, INFORMS, vol. 35(4), pages 389-404, November.
    15. Dial, Robert B., 1997. "Bicriterion traffic assignment: Efficient algorithms plus examples," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 357-379, October.
    16. Xie, Chi & Liu, Zugang, 2014. "On the stochastic network equilibrium with heterogeneous choice inertia," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 90-109.
    17. Yang, Hai, 1997. "Sensitivity analysis for the elastic-demand network equilibrium problem with applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 55-70, February.
    18. Yuan, Yun & Yu, Jie, 2018. "Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 85-103.

    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:eee:transb:v:18:y:1984:i:2:p:123-133. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.