IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v141y2026ics0305048325002105.html

Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium

Author

Listed:
  • Liang, Mingzhang
  • Xu, Min
  • Wang, Shuaian

Abstract

In this study, we investigate the joint optimization design of transit and bike-sharing systems (JDTB) at the strategic planning level, where the transit network, operating frequencies of transit lines, bike-sharing parking locations, and associated bike deployment numbers are simultaneously determined. Considering that transit and bike-sharing systems are operated by different operators with various objectives, we propose a multi-objective bi-level optimization model to formulate the JDTB problem. The upper-level optimization has two competing objectives: namely, the transit objective to minimize overall costs for both users and the transit operator, and the bike-sharing objective to maximize bike-sharing profits. At the lower level, a stochastic user equilibrium (SUE) assignment model is proposed to capture users’ choice behaviors in integrated transit-bike systems. To achieve more realistic choice behaviors and provide practical and reliable JDTB solutions, this model considers various impact factors on users’ decision-making processes, including congestion and common-line issues in transit systems, bike availability and reuse, as well as multimode combination and transfers in trip chains. Moreover, a diagonalization method combined with an iterative balancing scheme as well as a meta-heuristic algorithm based on NSGA-II are developed to solve the SUE and JDTB problems, respectively. Numerical experiments demonstrate the efficacy of the proposed model and algorithm in achieving trade-off solutions between the interests of transit and bike-sharing operators.

Suggested Citation

  • Liang, Mingzhang & Xu, Min & Wang, Shuaian, 2026. "Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium," Omega, Elsevier, vol. 141(C).
    • Handle: RePEc:eee:jomega:v:141:y:2026:i:c:s0305048325002105
    DOI: 10.1016/j.omega.2025.103484
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048325002105
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2025.103484?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Arbex, Renato Oliveira & da Cunha, Claudio Barbieri, 2015. "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 355-376.
    2. Li, Xin & Luo, Yue & Wang, Tianqi & Jia, Peng & Kuang, Haibo, 2020. "An integrated approach for optimizing bi-modal transit networks fed by shared bikes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    3. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    4. Zhi-Chun Li & William Lam & S. Wong, 2009. "The Optimal Transit Fare Structure under Different Market Regimes with Uncertainty in the Network," Networks and Spatial Economics, Springer, vol. 9(2), pages 191-216, June.
    5. Zhou, Yu & Yang, Hai & Wang, Yun & Yan, Xuedong, 2021. "Integrated line configuration and frequency determination with passenger path assignment in urban rail transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 134-151.
    6. Wu, Liyu & Gu, Weihua & Fan, Wenbo & Cassidy, Michael J., 2020. "Optimal design of transit networks fed by shared bikes," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 63-83.
    7. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    8. Lam, William H. K. & Zhou, Jing & Sheng, Zhao-han, 2002. "A capacity restraint transit assignment with elastic line frequency," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 919-938, December.
    9. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    10. Lin, Jenn-Rong & Yang, Ta-Hui, 2011. "Strategic design of public bicycle sharing systems with service level constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(2), pages 284-294, March.
    11. 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.
    12. Alvarez-Valdes, Ramon & Belenguer, Jose M. & Benavent, Enrique & Bermudez, Jose D. & Muñoz, Facundo & Vercher, Enriqueta & Verdejo, Francisco, 2016. "Optimizing the level of service quality of a bike-sharing system," Omega, Elsevier, vol. 62(C), pages 163-175.
    13. Erdoğan, Güneş & Battarra, Maria & Wolfler Calvo, Roberto, 2015. "An exact algorithm for the static rebalancing problem arising in bicycle sharing systems," European Journal of Operational Research, Elsevier, vol. 245(3), pages 667-679.
    14. Michael Florian, 1977. "A Traffic Equilibrium Model of Travel by Car and Public Transit Modes," Transportation Science, INFORMS, vol. 11(2), pages 166-179, May.
    15. Cepeda, M. & Cominetti, R. & Florian, M., 2006. "A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    16. Watling, David Paul & Rasmussen, Thomas Kjær & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2018. "Stochastic user equilibrium with a bounded choice model," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 254-280.
    17. Daganzo, Carlos F., 2010. "Structure of competitive transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 434-446, May.
    18. 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.
    19. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    20. Lam, W. H. K. & Gao, Z. Y. & Chan, K. S. & Yang, H., 1999. "A stochastic user equilibrium assignment model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 351-368, June.
    21. Asadi Bagloee, Saeed & Ceder, Avishai (Avi), 2011. "Transit-network design methodology for actual-size road networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1787-1804.
    22. Esteve Codina, 2013. "A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian," Transportation Science, INFORMS, vol. 47(2), pages 231-246, May.
    23. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    24. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    25. Joaquín de Cea & Enrique Fernández, 1993. "Transit Assignment for Congested Public Transport Systems: An Equilibrium Model," Transportation Science, INFORMS, vol. 27(2), pages 133-147, May.
    26. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    27. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    28. Fisk, C. S., 1984. "Game theory and transportation systems modelling," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 301-313.
    29. Zhou, Chang & Li, Xiang & Feng, Bo, 2025. "Build or cooperate with a bike-sharing system? Operation mode selection of metro operator with different information sharing strategies," Omega, Elsevier, vol. 133(C).
    30. Li, Xiang & Wang, Xianzhe & Feng, Ziyan, 2024. "Dynamic repositioning in bike-sharing systems with uncertain demand: An improved rolling horizon framework," Omega, Elsevier, vol. 126(C).
    31. Conrow, Lindsey & Murray, Alan T. & Fischer, Heather A., 2018. "An optimization approach for equitable bicycle share station siting," Journal of Transport Geography, Elsevier, vol. 69(C), pages 163-170.
    32. Rahul Nair & Elise Miller-Hooks, 2011. "Fleet Management for Vehicle Sharing Operations," Transportation Science, INFORMS, vol. 45(4), pages 524-540, November.
    33. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    34. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
    35. Kalyanmoy Deb & Kalyanmoy Deb, 2014. "Multi-objective Optimization," Springer Books, in: Edmund K. Burke & Graham Kendall (ed.), Search Methodologies, edition 2, chapter 0, pages 403-449, Springer.
    36. Liang, Mingzhang & Xu, Min & Wang, Shuaian, 2025. "A novel multi-objective evolutionary algorithm for transit network design and frequency-setting problem considering passengers’ choice behaviors under station congestion," Transportation Research Part B: Methodological, Elsevier, vol. 197(C).
    37. Guo, Yuhan & Li, Jinning & Xiao, Linfan & Allaoui, Hamid & Choudhary, Alok & Zhang, Lufang, 2024. "Efficient inventory routing for Bike-Sharing Systems: A combinatorial reinforcement learning framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    3. Javier Durán-Micco & Pieter Vansteenwegen, 2022. "A survey on the transit network design and frequency setting problem," Public Transport, Springer, vol. 14(1), pages 155-190, March.
    4. Liang, Mingzhang & Xu, Min & Wang, Shuaian, 2025. "A novel multi-objective evolutionary algorithm for transit network design and frequency-setting problem considering passengers’ choice behaviors under station congestion," Transportation Research Part B: Methodological, Elsevier, vol. 197(C).
    5. 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).
    6. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    7. Du, Muqing & Chen, Anthony, 2022. "Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 175-202.
    8. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    9. Wang, Xingrong & Canca, David & Lv, Ying & Zhao, Yiwei & Sun, Huijun & Wu, Jianjun, 2025. "Hierarchical bus transit network design in coordination with an existing metro system," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    10. Wang, Zhichao & Jiang, Rui & Jiang, Yu & Gao, Ziyou & Liu, Ronghui, 2024. "Modelling bus bunching along a common line corridor considering passenger arrival time and transfer choice under stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    11. Wu, Haoyu & Zeng, Junwei & Qian, Yongsheng & Wei, Xu, 2025. "Dynamic passenger flow assignment in urban rail transit networks based on AFC data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 680(C).
    12. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    13. 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.
    14. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    15. Hamdouch, Younes & Szeto, W.Y. & Jiang, Y., 2014. "A new schedule-based transit assignment model with travel strategies and supply uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 35-67.
    16. Li, Guoyuan & Chen, Anthony, 2022. "Frequency-based path flow estimator for transit origin-destination trip matrices incorporating automatic passenger count and automatic fare collection data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    17. Cortés, Cristián E. & Donoso, Pedro & Gutiérrez, Leonel & Herl, Daniel & Muñoz, Diego, 2023. "A recursive stochastic transit equilibrium model estimated using passive data from Santiago, Chile," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    18. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    19. Fan, Yinchao & Ding, Jianxun & Liu, Haoxiang & Wang, Yu & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    20. Khani, Alireza, 2019. "An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 549-564.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:jomega:v:141:y:2026:i:c:s0305048325002105. 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/wps/find/journaldescription.cws_home/375/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.