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

An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

Author

Listed:
  • Frédéric Babonneau

    (Centro de Modelamiento Matemático, University of Chile, Santiago, Chile)

  • Jean-Philippe Vial

    (ORDECSYS, CH-1224 Chêne-Bougeries, Switzerland, and University of Geneva, CH-1211 Geneva 4, Switzerland)

Abstract

The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose to use a variant of the analytic center cutting plane method to solve this problem. We test the method on TAP instances with the Bureau of Public Roads congestion function and different demand functions (constant elasticity and linear). The results of the numerical experiments show that it is possible to solve large instances with high accuracy.

Suggested Citation

  • Frédéric Babonneau & Jean-Philippe Vial, 2008. "An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands," Transportation Science, INFORMS, vol. 42(2), pages 249-260, May.
    • Handle: RePEc:inm:ortrsc:v:42:y:2008:i:2:p:249-260
    DOI: 10.1287/trsc.1070.0208
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1070.0208
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1070.0208?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
    ---><---

    References listed on IDEAS

    as
    1. Fukushima, Masao, 1984. "On the dual approach to the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(3), pages 235-245, June.
    2. Antonio Frangioni & Giorgio Gallo, 1999. "A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 370-393, November.
    3. Nathan H. Gartner, 1980. "Optimal Traffic Assignment with Elastic Demands: A Review Part II. Algorithmic Approaches," Transportation Science, INFORMS, vol. 14(2), pages 192-208, May.
    4. A. Ouorou & P. Mahey & J.-Ph. Vial, 2000. "A Survey of Algorithms for Convex Multicommodity Flow Problems," Management Science, INFORMS, vol. 46(1), pages 126-147, January.
    5. F. Babonneau & O. du Merle & J.-P. Vial, 2006. "Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM," Operations Research, INFORMS, vol. 54(1), pages 184-197, February.
    6. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    7. J. L. Goffin & A. Haurie & J. P. Vial, 1992. "Decomposition and Nondifferentiable Optimization with the Projective Algorithm," Management Science, INFORMS, vol. 38(2), pages 284-302, February.
    8. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.
    9. Dial, Robert B., 2006. "A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 917-936, December.
    10. Nathan H. Gartner, 1980. "Optimal Traffic Assignment with Elastic Demands: A Review Part I. Analysis Framework," Transportation Science, INFORMS, vol. 14(2), pages 174-191, May.
    11. Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
    12. P. Chardaire & A. Lisser, 2002. "Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems," Operations Research, INFORMS, vol. 50(2), pages 260-276, April.
    13. Michael Florian & Sang Nguyen, 1974. "A Method for Computing Network Equilibrium with Elastic Demands," Transportation Science, INFORMS, vol. 8(4), pages 321-332, November.
    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. Babonneau, F. & Vial, J.-P., 2010. "A partitioning algorithm for the network loading problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 173-179, July.
    2. Yan-Qun Jiang & S.C. Wong & Peng Zhang & Keechoo Choi, 2017. "Dynamic Continuum Model with Elastic Demand for a Polycentric Urban City," Transportation Science, INFORMS, vol. 51(3), pages 931-945, August.
    3. Qiang Zhang & Shi Qiang Liu & Andrea D’Ariano, 2023. "Bi-objective bi-level optimization for integrating lane-level closure and reversal in redesigning transportation networks," Operational Research, Springer, vol. 23(2), pages 1-51, June.
    4. Chu, Chih-Peng & Tsai, Jyh-Fa & Hu, Shou-Ren, 2012. "Optimal starting location of an HOV lane for a linear monocentric urban area," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(3), pages 457-466.
    5. Xu, Zhandong & Chen, Anthony & Li, Guoyuan & Li, Zhengyang & Liu, Xiaobo, 2024. "Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    6. Wang, Aihu & Tang, Yuanhua & Mohmand, Yasir Tariq & Xu, Pei, 2022. "Modifying link capacity to avoid Braess Paradox considering elastic demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).

    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. Wang, Aihu & Tang, Yuanhua & Mohmand, Yasir Tariq & Xu, Pei, 2022. "Modifying link capacity to avoid Braess Paradox considering elastic demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    2. F. Babonneau & O. du Merle & J.-P. Vial, 2006. "Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM," Operations Research, INFORMS, vol. 54(1), pages 184-197, February.
    3. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    4. Liu, Zhiyuan & Chen, Xinyuan & Hu, Jintao & Wang, Shuaian & Zhang, Kai & Zhang, Honggang, 2023. "An alternating direction method of multipliers for solving user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1072-1084.
    5. Jafari, Ehsan & Boyles, Stephen D., 2016. "Improved bush-based methods for network contraction," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 298-313.
    6. Jafari, Ehsan & Pandey, Venktesh & Boyles, Stephen D., 2017. "A decomposition approach to the static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 270-296.
    7. 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.
    8. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    9. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    10. Prateek Bansal & Rohan Shah & Stephen D. Boyles, 2018. "Robust network pricing and system optimization under combined long-term stochasticity and elasticity of travel demand," Transportation, Springer, vol. 45(5), pages 1389-1418, September.
    11. Bar-Gera, Hillel & Hellman, Fredrik & Patriksson, Michael, 2013. "Computational precision of traffic equilibria sensitivities in automatic network design and road pricing," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 485-500.
    12. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    13. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    14. Jaller, Miguel & Pahwa, Anmol & Zhang, Michael, 2021. "Cargo Routing and Disadvantaged Communities," Institute of Transportation Studies, Working Paper Series qt9qg2318x, Institute of Transportation Studies, UC Davis.
    15. Hong Gao & Kai Liu & Xinchao Peng & Cheng Li, 2020. "Optimal Location of Fast Charging Stations for Mixed Traffic of Electric Vehicles and Gasoline Vehicles Subject to Elastic Demands," Energies, MDPI, vol. 13(8), pages 1-16, April.
    16. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    17. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    18. 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.
    19. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    20. Zhang, Honggang & Liu, Zhiyuan & Wang, Jian & Wu, Yunchi, 2023. "A novel flow update policy in solving traffic assignment problems: Successive over relaxation iteration method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).

    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:42:y:2008:i:2:p:249-260. 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: 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.