IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v102y2017icp38-54.html
   My bibliography  Save this article

Analysis of an idealized system of demand adaptive paired-line hybrid transit

Author

Listed:
  • Chen, Peng Will
  • Nie, Yu Marco

Abstract

This paper proposes and analyzes a new transit system that integrates the traditional fixed-route service with a demand-adaptive service. The demand-adaptive service connects passengers from their origin/destination to the fixed-route service in order to improve accessability. The proposed hybrid design is unique in that it operates the demand-adaptive service with a stable headway to cover all stops along a paired fixed-route line. Pairing demand-adaptive vehicles with a fixed-route line simplifies the complexity of on-demand routing, because the vehicles can follow a more predictable path and can be dispatched on intervals coordinated with the fixed-route line. The design of the two services are closely coupled to minimize the total system cost, which incudes both the transit agency’s operating cost and the user cost. The optimal design model is formulated as a mixed integer program and solved using a commercially available metaheuristic. Numerical experiments are conducted to compare the demand adaptive paired-line hybrid transit (DAPL-HT) system with two related transit systems that may be considered its special cases: a fixed-route system and a flexible-route system. We show that the DAPL-HT system outperforms the other two systems under a wide range of demand levels and in various scenarios of input parameters. A discrete-event simulation model is also developed and applied to confirm the correctness of the analytical results.

Suggested Citation

  • Chen, Peng Will & Nie, Yu Marco, 2017. "Analysis of an idealized system of demand adaptive paired-line hybrid transit," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 38-54.
    • Handle: RePEc:eee:transb:v:102:y:2017:i:c:p:38-54
    DOI: 10.1016/j.trb.2017.05.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516305562
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.05.004?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. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.
    2. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    3. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    4. Daganzo, Carlos F., 1984. "Checkpoint dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 315-327.
    5. Peter Mieszkowski & Edwin S. Mills, 1993. "The Causes of Metropolitan Suburbanization," Journal of Economic Perspectives, American Economic Association, vol. 7(3), pages 135-147, Summer.
    6. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
    7. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    8. 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.
    9. Ceder, Avishai & Wilson, Nigel H. M., 1986. "Bus network design," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 331-344, August.
    10. David M. Stein, 1978. "Scheduling Dial-a-Ride Transportation Systems," Transportation Science, INFORMS, vol. 12(3), pages 232-249, August.
    11. Daganzo, Carlos F., 2010. "Structure of competitive transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 434-446, May.
    12. S. Chandana Wirasinghe & Vanolin F. Hurdle & Gordon F. Newell, 1977. "Optimal Parameters for a Coordinated Rail and Bus Transit System," Transportation Science, INFORMS, vol. 11(4), pages 359-374, November.
    13. A Pratelli & F Schoen, 2001. "A mathematical programming model for the bus deviation route problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 494-502, May.
    14. G. F. Newell, 1979. "Some Issues Relating to the Optimal Design of Bus Routes," Transportation Science, INFORMS, vol. 13(1), pages 20-35, February.
    15. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    16. Aldaihani, Majid M. & Quadrifoglio, Luca & Dessouky, Maged M. & Hall, Randolph, 2004. "Network design for a grid hybrid transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 511-530, August.
    17. Matthew E. Kahn, 2000. "The environmental impact of suburbanization," Journal of Policy Analysis and Management, John Wiley & Sons, Ltd., vol. 19(4), pages 569-586.
    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. Luo, Sida & Nie, Yu (Marco), 2019. "Impact of ride-pooling on the nature of transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 175-192.
    2. Chen, Peng (Will) & Nie, Yu (Marco), 2018. "Optimal design of demand adaptive paired-line hybrid transit: Case of radial route structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 71-89.
    3. Luo, Sida & Nie, Yu (Marco), 2020. "Paired-line hybrid transit design considering spatial heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 320-339.
    4. G. Dikas & I. Minis, 2018. "Scheduled Paratransit Transport Enhanced by Accessible Taxis," Transportation Science, INFORMS, vol. 52(5), pages 1122-1140, October.
    5. Luo, Sida & Nie, Yu (Marco), 2020. "On the role of route choice modeling in transit sketchy design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 136(C), pages 223-243.
    6. 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.
    7. Zhao, Jiamin & Dessouky, Maged, 2008. "Service capacity design problems for mobility allowance shuttle transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 135-146, February.
    8. Liu, Yining & Ouyang, Yanfeng, 2021. "Mobility service design via joint optimization of transit networks and demand-responsive services," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 22-41.
    9. Chandra, Shailesh & Quadrifoglio, Luca, 2013. "A model for estimating the optimal cycle length of demand responsive feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 1-16.
    10. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    11. Badia, Hugo & Estrada, Miquel & Robusté, Francesc, 2014. "Competitive transit network design in cities with radial street patterns," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 161-181.
    12. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    13. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
    14. Fan, Wenbo & Mei, Yu & Gu, Weihua, 2018. "Optimal design of intersecting bimodal transit networks in a grid city," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 203-226.
    15. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    16. Quadrifoglio, Luca & Li, Xiugang, 2009. "A methodology to derive the critical demand density for designing and operating feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 922-935, December.
    17. Proboste, Francisco & Muñoz, Juan Carlos & Gschwender, Antonio, 2020. "Comparing social costs of public transport networks structured around an Open and Closed BRT corridor in medium sized cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 138(C), pages 187-212.
    18. Bruni, M.E. & Guerriero, F. & Beraldi, P., 2014. "Designing robust routes for demand-responsive transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 1-16.
    19. Ouyang, Yanfeng & Nourbakhsh, Seyed Mohammad & Cassidy, Michael J., 2014. "Continuum approximation approach to bus network design under spatially heterogeneous demand," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 333-344.
    20. 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.

    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:transb:v:102:y:2017:i:c:p:38-54. 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/548/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.