IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v15y2015i4p1011-1048.html
   My bibliography  Save this article

Combined Gravity Model Trip Distribution and Paired Combinatorial Logit Stochastic User Equilibrium Problem

Author

Listed:
  • Ampol Karoonsoontawong
  • Dung-Ying Lin

Abstract

The equivalent mathematical formulation of the combined doubly-constrained gravity-based trip distribution and paired-combinatorial-logit stochastic user equilibrium assignment problem (CDA-PCL-SUE) is proposed. Its first order conditions are shown to be equal to the gravity equations and PCL formula. The proposed solution method is a path-based partial linearization algorithm to approximately solve the restricted CDA-PCL-SUE. The proposed algorithm is a three-phase iterative process. Phase 1 is an entropy maximization problem on O-D flow space that can be solved by Bregman’s balancing algorithm. Phase 2 is a PCL SUE problem that can be solved by PCL formula. Phase 3 is line search. CDA-PCL-SUE is solved on a small network and a real network, the city of Winnipeg network. The proposed algorithms with the six line search methods, namely, golden section (GS), bisection (BS), Armijo’s rule (AR), method of successive averages (MSA), self-regulated averaging (SRA) scheme, and quadratic interpolation (QI) scheme, are compared in terms of various convergence characteristics: root mean square error, step size, KKT-based mean square error and objective function. In terms of computational efficiency, under different path set sizes, dispersion parameters, impedance parameters and demand levels, the following line search methods are ordered from best to worst: SRA, GS, AR, QI, BS and MSA. The performances of Armijo’s rule and QI have greater variances. The performance of QI is worse with the increase of the path set size. Given all other factors being the same, the increase of dispersion parameter, path set size or demand level yields the increase of CPU time, whereas the change of impedance parameter does not influence CPU time. In addition, CDA-PCL-SUE is compared with its multinomial-logit counterpart (CDA-MNL-SUE). Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Ampol Karoonsoontawong & Dung-Ying Lin, 2015. "Combined Gravity Model Trip Distribution and Paired Combinatorial Logit Stochastic User Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 15(4), pages 1011-1048, December.
    • Handle: RePEc:kap:netspa:v:15:y:2015:i:4:p:1011-1048
    DOI: 10.1007/s11067-014-9279-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-014-9279-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-014-9279-x?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. Michael Florian & Sang Nguyen & Jacques Ferland, 1975. "On the Combined Distribution-Assignment of Traffic," Transportation Science, INFORMS, vol. 9(1), pages 43-53, February.
    2. Oppenheim, Norbert, 1993. "Equilibrium trip distribution/assignment with variable destination costs," Transportation Research Part B: Methodological, Elsevier, vol. 27(3), pages 207-217, June.
    3. Lam, William H. K. & Huang, Hai-Jun, 1992. "A combined trip distribution and assignment model for multiple user classes," Transportation Research Part B: Methodological, Elsevier, vol. 26(4), pages 275-287, August.
    4. Chen, Anthony & Pravinvongvuth, Surachet & Xu, Xiangdong & Ryu, Seungkyu & Chootinan, Piya, 2012. "Examining the scaling effect and overlapping problem in logit-based stochastic user equilibrium models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(8), pages 1343-1358.
    5. 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.
    6. Patriksson, Michael, 1993. "A unified description of iterative algorithms for traffic equilibria," European Journal of Operational Research, Elsevier, vol. 71(2), pages 154-176, December.
    7. Henry Liu & Xiaozheng He & Bingsheng He, 2009. "Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 9(4), pages 485-503, December.
    8. Yang, Hai & Wong, S. C. & Wong, K. I., 2002. "Demand-supply equilibrium of taxi services in a network under competition and regulation," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 799-819, November.
    9. Boyce, D. E. & Janson, B. N., 1980. "A discrete transportation network design problem with combined trip distribution and assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 147-154.
    10. Chen, Anthony & Kasikitwiwat, Panatda, 2011. "Modeling capacity flexibility of transportation networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(2), pages 105-117, February.
    11. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    12. Huang, Hai-Jun & Lam, William H. K., 1992. "Modified Evans' algorithms for solving the combined trip distribution and assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(4), pages 325-337, August.
    13. Dawei Li & Tomio Miwa & Takayuki Morikawa, 2014. "Considering En-Route Choices in Utility-Based Route Choice Modelling," Networks and Spatial Economics, Springer, vol. 14(3), pages 581-604, December.
    14. Bekhor, Shlomo & Prashker, Joseph N., 2008. "GEV-based destination choice models that account for unobserved similarities among alternatives," Transportation Research Part B: Methodological, Elsevier, vol. 42(3), pages 243-262, March.
    15. Damberg, Olof & Lundgren, Jan T. & Patriksson, Michael, 1996. "An algorithm for the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 115-131, April.
    16. Yang, Hai & Bell, Michael G. H. & Meng, Qiang, 2000. "Modeling the capacity and level of service of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 255-275, May.
    17. Tam, M. L. & Lam, William H. K., 2000. "Maximum car ownership under constraints of road capacity and parking space," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(3), pages 145-170, April.
    18. Kitthamkesorn, Songyot & Chen, Anthony, 2014. "Unconstrained weibit stochastic user equilibrium model with extensions," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 1-21.
    19. 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.
    20. Torbjörn Larsson & Michael Patriksson, 1992. "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 26(1), pages 4-17, February.
    21. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    22. Lamond, B. & Stewart, N. F., 1981. "Bregman's balancing method," Transportation Research Part B: Methodological, Elsevier, vol. 15(4), pages 239-248, August.
    23. Anthony Chen & Chao Yang & Sirisak Kongsomsaksakul & Ming Lee, 2007. "Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks," Networks and Spatial Economics, Springer, vol. 7(3), pages 241-256, September.
    24. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.
    25. Lam, William H. K. & Huang, Hai-Jun, 1992. "Calibration of the combined trip distribution and assignment model for multiple user classes," Transportation Research Part B: Methodological, Elsevier, vol. 26(4), pages 289-305, August.
    26. Erlander, S., 1990. "Efficient population behavior and the simultaneous choices of origins, destinations and routes," Transportation Research Part B: Methodological, Elsevier, vol. 24(5), pages 363-373, October.
    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. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    2. 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.
    3. Heng Zhang & Paat Rusmevichientong & Huseyin Topaloglu, 2020. "Assortment Optimization Under the Paired Combinatorial Logit Model," Operations Research, INFORMS, vol. 68(3), pages 741-761, May.

    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. 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.
    2. Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
    3. 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.
    4. 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.
    5. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.
    6. Yang, Chao & Chen, Anthony, 2009. "Sensitivity analysis of the combined travel demand model with applications," European Journal of Operational Research, Elsevier, vol. 198(3), pages 909-921, November.
    7. Kitthamkesorn, Songyot & Chen, Anthony, 2017. "Alternate weibit-based model for assessing green transport systems with combined mode and route travel choices," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 291-310.
    8. Yang, Chao & Chen, Anthony & Xu, Xiangdong & Wong, S.C., 2013. "Sensitivity-based uncertainty analysis of a combined travel demand model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 225-244.
    9. Rasmussen, Thomas Kjær & Watling, David Paul & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 146-165.
    10. Heqing Tan & Muqing Du & Xiaowei Jiang & Zhaoming Chu, 2019. "The Combined Distribution and Assignment Model: A New Solution Algorithm and Its Applications in Travel Demand Forecasting for Modern Urban Transportation," Sustainability, MDPI, vol. 11(7), pages 1-18, April.
    11. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    12. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    13. Cantarella, Giulio Erberto & Cartenì, Armando & de Luca, Stefano, 2015. "Stochastic equilibrium assignment with variable demand: Theoretical and implementation issues," European Journal of Operational Research, Elsevier, vol. 241(2), pages 330-347.
    14. Jian Wang & Muqing Du & Lili Lu & Xiaozheng He, 2018. "Maximizing Network Throughput under Stochastic User Equilibrium with Elastic Demand," Networks and Spatial Economics, Springer, vol. 18(1), pages 115-143, March.
    15. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    16. Gu, Yu & Chen, Anthony & Kitthamkesorn, Songyot, 2022. "Weibit choice models: Properties, mode choice application and graphical illustrations," Journal of choice modelling, Elsevier, vol. 44(C).
    17. Bekhor, Shlomo & Toledo, Tomer, 2005. "Investigating path-based solution algorithms to the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 279-295, March.
    18. Boyce, David, 2007. "Future research on urban transportation network modeling," Regional Science and Urban Economics, Elsevier, vol. 37(4), pages 472-481, July.
    19. Alireza Ermagun & David M Levinson, 2019. "Development and application of the network weight matrix to predict traffic flow for congested and uncongested conditions," Environment and Planning B, , vol. 46(9), pages 1684-1705, November.
    20. 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.

    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:kap:netspa:v:15:y:2015:i:4:p:1011-1048. 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.