IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v10y2018i11p4275-d183822.html
   My bibliography  Save this article

A Multi-Modal Route Choice Model with Ridesharing and Public Transit

Author

Listed:
  • Meng Li

    (School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China)

  • Guowei Hua

    (School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China)

  • Haijun Huang

    (School of Economics and Management, Beihang University, Beijing 100191, China)

Abstract

With the extensive use of smart-phone applications and online payment systems, more travelers choose to participate in ridesharing activities. In this paper, a multi-modal route choice model is proposed by incorporating ridesharing and public transit in a single-origin-destination (OD)-pair network. Due to the presence of ridesharing, travelers not only choose routes (including main road and side road), but also decide travel modes (including solo driver, ridesharing driver, ridesharing passenger, and transit passenger) to minimize travelers’ generalized travel cost (not their actual travel cost due to the existence of car capacity constraints). The proposed model is expressed as an equivalent complementarity problem. Finally, the impacts of key factors on ridesharing behavior in numerical examples are discussed. The equilibrium results show that passengers’ rewards and toll charge of solo drivers on main road significantly affect the travelers’ route and mode choice behavior, and an increase of passengers’ rewards (toll) motivates (forces) more travelers to take environmentally friendly travel modes.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jsusta:v:10:y:2018:i:11:p:4275-:d:183822
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/10/11/4275/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/10/11/4275/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Oren Bahat & Shlomo Bekhor, 2016. "Incorporating Ridesharing in the Static Traffic Assignment Model," Networks and Spatial Economics, Springer, vol. 16(4), pages 1125-1149, December.
    3. Yitian Wang & Zixuan Peng & Keming Wang & Xiaolin Song & Baozhen Yao & Tao Feng, 2015. "Research on Urban Road Congestion Pricing Strategy Considering Carbon Dioxide Emissions," Sustainability, MDPI, vol. 7(8), pages 1-20, August.
    4. Todd Litman & David Burwell, 2006. "Issues in sustainable transportation," International Journal of Global Environmental Issues, Inderscience Enterprises Ltd, vol. 6(4), pages 331-347.
    5. 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.
    6. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2015. "The Benefits of Meeting Points in Ride-sharing Systems," ERIM Report Series Research in Management ERS-2015-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Xu, Huayu & Pang, Jong-Shi & Ordóñez, Fernando & Dessouky, Maged, 2015. "Complementarity models for traffic equilibrium with ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 161-182.
    8. Xiaolei Wang & Hai Yang & Daoli Zhu, 2018. "Driver-Rider Cost-Sharing Strategies and Equilibria in a Ridesharing Program," Transportation Science, INFORMS, vol. 52(4), pages 868-881, August.
    9. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    10. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    11. Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
    12. Frederick A. Armah & David O. Yawson & Alex A. N. M. Pappoe, 2010. "A Systems Dynamics Approach to Explore Traffic Congestion and Air Pollution Link in the City of Accra, Ghana," Sustainability, MDPI, vol. 2(1), pages 1-14, January.
    13. Catherine Morency, 2007. "The ambivalence of ridesharing," Transportation, Springer, vol. 34(2), pages 239-253, March.
    14. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2015. "The benefits of meeting points in ride-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 36-53.
    15. Yuanyuan Zhang & Yuming Zhang, 2018. "Examining the Relationship between Household Vehicle Ownership and Ridesharing Behaviors in the United States," Sustainability, MDPI, vol. 10(8), pages 1-24, August.
    16. Agatz, Niels A.H. & Erera, Alan L. & Savelsbergh, Martin W.P. & Wang, Xing, 2011. "Dynamic ride-sharing: A simulation study in metro Atlanta," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1450-1464.
    17. Athanasios K. Ziliaskopoulos, 2000. "A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 37-49, February.
    18. Xiao, Ling-Ling & Liu, Tian-Liang & Huang, Hai-Jun, 2016. "On the morning commute problem with carpooling behavior under parking space constraint," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 383-407.
    19. 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.
    20. Furuhata, Masabumi & Dessouky, Maged & Ordóñez, Fernando & Brunet, Marc-Etienne & Wang, Xiaoqing & Koenig, Sven, 2013. "Ridesharing: The state-of-the-art and future directions," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 28-46.
    21. 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.
    22. de Palma, André & Kilani, Moez & Lindsey, Robin, 2005. "Congestion pricing on a road network: A study using the dynamic equilibrium simulator METROPOLIS," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(7-9), pages 588-611.
    23. Fukushima, Masao, 1984. "A modified Frank-Wolfe algorithm for solving the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 169-177, April.
    24. Ma, Rui & Zhang, H.M., 2017. "The morning commute problem with ridesharing and dynamic parking charges," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 345-374.
    25. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    26. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.
    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. Zhu, Zheng & Qin, Xiaoran & Ke, Jintao & Zheng, Zhengfei & Yang, Hai, 2020. "Analysis of multi-modal commute behavior with feeding and competing ridesplitting services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 713-727.

    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. Long, Jiancheng & Tan, Weimin & Szeto, W.Y. & Li, Yao, 2018. "Ride-sharing with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 143-171.
    2. Tian, Li-Jun & Sheu, Jiuh-Biing & Huang, Hai-Jun, 2019. "The morning commute problem with endogenous shared autonomous vehicle penetration and parking space constraint," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 258-278.
    3. Zhong, Lin & Zhang, Kenan & (Marco) Nie, Yu & Xu, Jiuping, 2020. "Dynamic carpool in morning commute: Role of high-occupancy-vehicle (HOV) and high-occupancy-toll (HOT) lanes," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 98-119.
    4. Wang, Jing-Peng & Ban, Xuegang (Jeff) & Huang, Hai-Jun, 2019. "Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 390-415.
    5. Ruijie Li & Yu (Marco) Nie & Xiaobo Liu, 2020. "Pricing Carpool Rides Based on Schedule Displacement," Transportation Science, INFORMS, vol. 54(4), pages 1134-1152, July.
    6. Sun, S. & Szeto, W.Y., 2021. "Multi-class stochastic user equilibrium assignment model with ridesharing: Formulation and policy implications," Transportation Research Part A: Policy and Practice, Elsevier, vol. 145(C), pages 203-227.
    7. Ke, Jintao & Yang, Hai & Zheng, Zhengfei, 2020. "On ride-pooling and traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 213-231.
    8. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    9. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    10. Omer Faruk Aydin & Ilgin Gokasar & Onur Kalan, 2020. "Matching algorithm for improving ride-sharing by incorporating route splits and social factors," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-23, March.
    11. Inayatullah Shah & Mohammed El Affendi & Basit Qureshi, 2020. "SRide: An Online System for Multi-Hop Ridesharing," Sustainability, MDPI, vol. 12(22), pages 1-29, November.
    12. Ma, Jie & Xu, Min & Meng, Qiang & Cheng, Lin, 2020. "Ridesharing user equilibrium problem under OD-based surge pricing strategy," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 1-24.
    13. Horner, Hannah & Pazour, Jennifer & Mitchell, John E., 2021. "Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    14. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    15. Fu, Yulan & Wang, Chenlan & Liu, Tian-Liang & Huang, Hai-Jun, 2021. "Parking management in the morning commute problem with ridesharing," Research in Transportation Economics, Elsevier, vol. 90(C).
    16. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2022. "Environmental and social implications of incorporating carpooling service on a customized bus system," Post-Print hal-03598768, HAL.
    17. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    18. Huang, Zhihui & Long, Jiancheng & Szeto, W.Y. & Liu, Haoxiang, 2021. "Modeling and managing the morning commute problem with park-and-ride-sharing," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 190-226.
    19. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.
    20. Rui Yao & Shlomo Bekhor, 2023. "A general equilibrium model for multi-passenger ridesharing systems with stable matching," Papers 2303.16595, arXiv.org, revised Dec 2023.

    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:gam:jsusta:v:10:y:2018:i:11:p:4275-:d:183822. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.