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

Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option

Author

Listed:
  • Han Zheng

    (School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

  • Junhua Chen

    (School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

  • Xingchen Zhang

    (School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

  • Zixian Yang

    (School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

Abstract

Currently, the green, sustainable development of metropolises is hindered by problems caused by Large-scale Instantaneous Peak-demands for Passenger-transportation (LIPP), such as traffic congestion and air pollution. To mitigate these problems, we propose a new type of demand-responsive service as an alternative to inefficient “door-to-door” service. The proposed service is based on service units designed to aggregate passengers for shuttle service. To guarantee service quality and efficiency, a maximum passenger walking time constraint, a request rejection mechanism and a scheme for ensuring solution feasibility are considered. Through numerical experiments, we prove the following: (i) the proposed transport option exhibits better performance (by 40.37% for passengers and by 35.79% for operators) than the door-to-door transport option for solving real cases. (ii) By testing different datasets, we prove that the proposed service is more suitable for the request distributions that are spatiotemporally concentrated. (iii) Regarding the individual components of the proposed clustering-first, routing-second solution framework, the proposed soft clustering algorithm exhibits better performance than the classical hard clustering method (by 8%), and the proposed routing algorithm is 1.5 times more efficient than the commercial solution software GAMS.

Suggested Citation

  • Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.
  • Handle: RePEc:gam:jsusta:v:11:y:2019:i:18:p:5025-:d:267131
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/18/5025/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/11/18/5025/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    2. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    3. Kek, Alvina G.H. & Cheu, Ruey Long & Meng, Qiang & Fung, Chau Ha, 2009. "A decision support system for vehicle relocation operations in carsharing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 149-158, January.
    4. E. S. Savas, 1978. "On Equity in Providing Public Services," Management Science, INFORMS, vol. 24(8), pages 800-808, April.
    5. 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.
    6. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
    7. Irina Ioachim & Jacques Desrosiers & Yvan Dumas & Marius M. Solomon & Daniel Villeneuve, 1995. "A Request Clustering Algorithm for Door-to-Door Handicapped Transportation," Transportation Science, INFORMS, vol. 29(1), pages 63-78, February.
    8. Marshall L. Fisher & Kurt O. Jörnsten & Oli B. G. Madsen, 1997. "Vehicle Routing with Time Windows: Two Optimization Algorithms," Operations Research, INFORMS, vol. 45(3), pages 488-492, June.
    9. Bard, Jonathan F. & Jarrah, Ahmad I., 2009. "Large-scale constrained clustering for rationalizing pickup and delivery operations," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 542-561, June.
    10. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    11. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling," Transportation Science, INFORMS, vol. 19(4), pages 378-410, November.
    12. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    13. Gérard C. Clarens & V. F. Hurdle, 1975. "An Operating Strategy for a Commuter Bus System," Transportation Science, INFORMS, vol. 9(1), pages 1-20, February.
    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. Jose L. Walteros & Andrés L. Medaglia & Germán Riaño, 2015. "Hybrid Algorithm for Route Design on Bus Rapid Transit Systems," Transportation Science, INFORMS, vol. 49(1), pages 66-84, February.
    16. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing," Transportation Science, INFORMS, vol. 19(4), pages 411-435, November.
    17. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.
    18. Jihui Ma & Yanqing Zhao & Yang Yang & Tao Liu & Wei Guan & Jiao Wang & Cuiying Song, 2017. "A Model for the Stop Planning and Timetables of Customized Buses," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-28, January.
    19. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    20. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
    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. Ma, Jiaxin & Chen, Xumei & Xing, Ziwen & Zhang, Yixin & Yu, Lei, 2023. "Improving the performance of airport shuttle through demand-responsive service with dynamic fare strategy considering mixed demand," Journal of Air Transport Management, Elsevier, vol. 112(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. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    2. Ma, Tai-Yu & Fang, Yumeng & Connors, Richard D. & Viti, Francesco & Nakao, Haruko, 2024. "A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    3. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    4. Mitrovic-Minic, Snezana & Laporte, Gilbert, 2004. "Waiting strategies for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 635-655, August.
    5. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    6. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    7. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    8. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    9. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    10. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    11. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    12. Lu, Chengqi & Maciejewski, Michal & Wu, Hao & Nagel, Kai, 2023. "Demand-responsive transport for students in rural areas: A case study in Vulkaneifel, Germany," Transportation Research Part A: Policy and Practice, Elsevier, vol. 178(C).
    13. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    14. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    15. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    16. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    17. Kirchler, Dominik & Wolfler Calvo, Roberto, 2013. "A Granular Tabu Search algorithm for the Dial-a-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 120-135.
    18. Shafahi, Ali & Wang, Zhongxiang & Haghani, Ali, 2018. "SpeedRoute: Fast, efficient solutions for school bus routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 473-493.
    19. Zhang, Li & Liu, Zhongshan & Yu, Bin & Long, Jiancheng, 2024. "A ridesharing routing problem for airport riders with electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    20. K Fagerholt & B A Foss & O J Horgen, 2009. "A decision support model for establishing an air taxi service: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1173-1182, September.

    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:11:y:2019:i:18:p:5025-:d:267131. 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.