IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v48y2021i3d10.1007_s11116-020-10093-0.html
   My bibliography  Save this article

Balanced strategy based on environment and user benefit-oriented carpooling service mode for commuting trips

Author

Listed:
  • Ning Ma

    (Xi’an University of Technology)

  • Ziqiang Zeng

    (Sichuan University)

  • Yinhai Wang

    (University of Washington)

  • Jiuping Xu

    (Sichuan University
    Sichuan University)

Abstract

Besides saving money and providing convenience, carpooling can result in environmental benefits to society; therefore, it is important to promote and improve daily carpooling services. However, some conflicts related to carpooling match rates and environmental protection have been influencing user satisfaction. To broaden the carpooling service scope and improve service flexibility, an environment and user benefit-oriented carpooling service model was developed that included mixed user groups, different user types, multiple origin and destination pairs, a time window and user attitudes, and considered the cost and time efficiency requirements of the users to guarantee individual benefits and provide more reasonable matches. A 0–1 nonlinear optimization model was built to describe the model and an improved genetic algorithm based on a nearby matching principle designed to find the optimal solution. Finally, a case simulation from Chengdu city was conducted to demonstrate the effectiveness of the proposed model and the influence of different user attitudes on the carbon emissions and match rates, from which it was found that the proposed carpooling mode was able to provide a more systematic carpooling plan, avoid the increased carbon emissions from potential mismatching due to time and efficiency losses, and guarante the maximum social benefit.

Suggested Citation

  • Ning Ma & Ziqiang Zeng & Yinhai Wang & Jiuping Xu, 2021. "Balanced strategy based on environment and user benefit-oriented carpooling service mode for commuting trips," Transportation, Springer, vol. 48(3), pages 1241-1266, June.
  • Handle: RePEc:kap:transp:v:48:y:2021:i:3:d:10.1007_s11116-020-10093-0
    DOI: 10.1007/s11116-020-10093-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11116-020-10093-0
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11116-020-10093-0?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. R M Jorgensen & J Larsen & K B Bergvinsdottir, 2007. "Solving the Dial-a-Ride problem using genetic algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1321-1331, October.
    2. 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.
    3. Matteo Mallus & Giuseppe Colistra & Luigi Atzori & Maurizio Murroni & Virginia Pilloni, 2017. "Dynamic Carpooling in Urban Areas: Design and Experimentation with a Multi-Objective Route Matching Algorith," Sustainability, MDPI, vol. 9(2), pages 1-21, February.
    4. Roberto Baldacci & Vittorio Maniezzo & Aristide Mingozzi, 2004. "An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation," Operations Research, INFORMS, vol. 52(3), pages 422-439, June.
    5. 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.
    6. Lee, Alan & Savelsbergh, Martin, 2015. "Dynamic ridesharing: Is there a role for dedicated drivers?," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 483-497.
    7. Jizhe Xia & Kevin M Curtin & Weihong Li & Yonglong Zhao, 2015. "A New Model for a Carpool Matching Service," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-23, June.
    8. Jun Guan Neoh & Maxwell Chipulu & Alasdair Marshall, 2017. "What encourages people to carpool? An evaluation of factors with meta-analysis," Transportation, Springer, vol. 44(2), pages 423-447, March.
    9. 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.
    10. 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.
    11. Matthew Palm & Susan Handy, 2018. "Sustainable transportation at the ballot box: a disaggregate analysis of the relative importance of user travel mode, attitudes and self-interest," Transportation, Springer, vol. 45(1), pages 121-141, January.
    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. María del Carmen Rey-Merchán & Antonio López-Arquillos & Manuela Pires Rosa, 2022. "Carpooling Systems for Commuting among Teachers: An Expert Panel Analysis of Their Barriers and Incentives," IJERPH, MDPI, vol. 19(14), pages 1-12, July.
    2. Xiaojuan Lu & Jianjun Wang & Choon Wah Yuen & Qian Liu, 2023. "Multi-Objective Intercity Carpooling Route Optimization Considering Carbon Emission," Sustainability, MDPI, vol. 15(3), pages 1-18, January.
    3. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(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. 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. 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.
    3. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    4. 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.
    5. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2016. "Making dynamic ride-sharing work: The impact of driver and rider flexibility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 190-207.
    6. 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.
    7. Arslan, A.M. & Agatz, N.A.H. & Kroon, L.G. & Zuidwijk, R.A., 2016. "Crowdsourced Delivery: A Dynamic Pickup and Delivery Problem with Ad-hoc Drivers," ERIM Report Series Research in Management ERS-2016-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.
    8. 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.
    9. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    10. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
    11. 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.
    12. 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.
    13. 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.
    14. Zixuan Peng & Wenxuan Shan & Peng Jia & Bin Yu & Yonglei Jiang & Baozhen Yao, 2020. "Stable ride-sharing matching for the commuters with payment design," Transportation, Springer, vol. 47(1), pages 1-21, February.
    15. 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.
    16. 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.
    17. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    18. 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.
    19. 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).
    20. 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.

    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:transp:v:48:y:2021:i:3:d:10.1007_s11116-020-10093-0. 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.