IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v135y2001i1p27-41.html
   My bibliography  Save this article

A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs

Author

Listed:
  • Chen, Anthony
  • Lo, Hong K.
  • Yang, Hai

Abstract

No abstract is available for this item.

Suggested Citation

  • Chen, Anthony & Lo, Hong K. & Yang, Hai, 2001. "A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs," European Journal of Operational Research, Elsevier, vol. 135(1), pages 27-41, November.
    • Handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:27-41
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00287-3
    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.

    References listed on IDEAS

    as
    1. Steven A. Gabriel & David Bernstein, 1997. "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, INFORMS, vol. 31(4), pages 337-348, November.
    2. Sang Nguyen & Clermont Dupuis, 1984. "An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs," Transportation Science, INFORMS, vol. 18(2), pages 185-202, May.
    3. Wong, S. C. & Yang, Chao & Lo, Hong K., 2001. "A path-based traffic assignment algorithm based on the TRANSYT traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 35(2), pages 163-181, February.
    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. Chen, Anthony & Zhou, Zhong & Lam, William H.K., 2011. "Modeling stochastic perception error in the mean-excess traffic equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1619-1640.
    2. Huang, Di & Liu, Zhiyuan & Liu, Pan & Chen, Jun, 2016. "Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 1-19.
    3. Zhou, Zhong & Chen, Anthony & Wong, S.C., 2009. "Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model," European Journal of Operational Research, Elsevier, vol. 198(1), pages 129-138, October.
    4. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2021. "Service operation design in a transit network with congested common lines," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 81-102.
    5. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    6. Yao, Jia & Chen, Anthony & Ryu, Seungkyu & Shi, Feng, 2014. "A general unconstrained optimization formulation for the combined distribution and assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 137-160.
    7. Yu Nie & H. Zhang, 2010. "Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback," Networks and Spatial Economics, Springer, vol. 10(1), pages 49-71, March.
    8. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2004. "Modeling private highways in networks with entry-exit based toll charges," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 191-213, March.
    9. Chen, Anthony & Choi, Keechoo, 2017. "Solving the combined modal split and traffic assignment problem with two types of transit impedance functionAuthor-Name: Ryu, Seungkyu," European Journal of Operational Research, Elsevier, vol. 257(3), pages 870-880.
    10. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    11. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    12. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2022. "Optimal deployment of autonomous buses into a transit service network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    13. Wang, Guangchao & Chen, Anthony & Kitthamkesorn, Songyot & Ryu, Seungkyu & Qi, Hang & Song, Ziqi & Song, Jianguo, 2020. "A multi-modal network equilibrium model with captive mode choice and path size logit route choice," Transportation Research Part A: Policy and Practice, Elsevier, vol. 136(C), pages 293-317.
    14. Xu, Xiangdong & Chen, Anthony & Cheng, Lin & Yang, Chao, 2017. "A link-based mean-excess traffic equilibrium model under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 53-75.
    15. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    16. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Rasouli, Soora & Huang, Hai-Jun, 2020. "Tolerance-based column generation for boundedly rational dynamic activity-travel assignment in large-scale networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    17. Chen, Anthony & Zhou, Zhong, 2010. "The [alpha]-reliable mean-excess traffic equilibrium model with stochastic travel times," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 493-513, May.
    18. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    19. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Timmermans, Harry, 2019. "Tolerance-based strategies for extending the column generation algorithm to the bounded rational dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 102-121.
    20. Han, Deren & Lo, Hong K., 2004. "Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 159(3), pages 529-544, December.
    21. Clark, Stephen D. & Watling, David P., 2006. "Applications of sensitivity analysis for probit stochastic network equilibrium," European Journal of Operational Research, Elsevier, vol. 175(2), pages 894-911, December.
    22. Yu, Qian & Fang, Debin & Du, Wei, 2014. "Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model," European Journal of Operational Research, Elsevier, vol. 239(1), pages 112-118.

    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. Han, Deren & Lo, Hong K., 2004. "Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 159(3), pages 529-544, December.
    2. Huang, Ruqing & Han, Lee D. & Huang, Zhongxiang, 2022. "A new network equilibrium flow model: User-equilibrium with quantity adjustment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    3. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    4. Huang, Hai-Jun & Li, Zhi-Chun, 2007. "A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1464-1477, February.
    5. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    6. Luan, Mingye & Waller, S.Travis & Rey, David, 2023. "A non-additive path-based reward credit scheme for traffic congestion management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    7. Chen, Anthony & Zhou, Zhong & Lam, William H.K., 2011. "Modeling stochastic perception error in the mean-excess traffic equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1619-1640.
    8. Lo, Hong K. & Chen, Anthony, 2000. "Traffic equilibrium problem with route-specific costs: formulation and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 493-513, August.
    9. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    10. Ehrgott, Matthias & Wang, Judith Y.T. & Watling, David P., 2015. "On multi-objective stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 704-717.
    11. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    12. Ji, Xiangfeng & Chu, Yanyu, 2020. "A target-oriented bi-attribute user equilibrium model with travelers’ perception errors on the tolled traffic network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    13. Li, Tongfei & Xu, Min & Sun, Huijun & Xiong, Jie & Dou, Xueping, 2023. "Stochastic ridesharing equilibrium problem with compensation optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 170(C).
    14. Sun, Mingmei, 2023. "A day-to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    15. Elnaz Miandoabchi & Reza Farahani & W. Szeto, 2012. "Bi-objective bimodal urban road network design using hybrid metaheuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 583-621, December.
    16. Andrea Raith & Judith Wang & Matthias Ehrgott & Stuart Mitchell, 2014. "Solving multi-objective traffic assignment," Annals of Operations Research, Springer, vol. 222(1), pages 483-516, November.
    17. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    18. Tan, Zhijia & Yang, Hai & Tan, Wei & Li, Zhichun, 2016. "Pareto-improving transportation network design and ownership regimes," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 292-309.
    19. Liu, Haoxiang & Wang, David Z.W., 2017. "Locating multiple types of charging facilities for battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 30-55.
    20. Michael W. Levin & Melissa Duell & S. Travis Waller, 2020. "Arrival Time Reliability in Strategic User Equilibrium," Networks and Spatial Economics, Springer, vol. 20(3), pages 803-831, September.

    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:ejores:v:135:y:2001:i:1:p:27-41. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.