IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v49y2015i1p85-98.html
   My bibliography  Save this article

Formulating a New Express Minibus Service Design Problem as a Clustering Problem

Author

Listed:
  • L. Miguel Martínez

    (Center for Urban and Regional Systems, Department of Civil Engineering, Instituto Superior Técnico, University of Lisbon, 1049-001 Lisboa, Portugal)

  • José Manuel Viegas

    (Center for Urban and Regional Systems, Department of Civil Engineering, Instituto Superior Técnico, University of Lisbon, 1049-001 Lisboa, Portugal)

  • Tomás Eiró

    (Center for Urban and Regional Systems, Department of Civil Engineering, Instituto Superior Técnico, University of Lisbon, 1049-001 Lisboa, Portugal)

Abstract

This paper presents the formulation of a new optimization problem designated as the express minibus problem, which intends to form small groups of clients with compatible boarding/exiting points in time and space for a new type of urban mobility service. This new transport option, as a competitive alternative to the private car, aims to provide almost direct services between dispersed demand poles in places where high-capacity and efficient public transport options are scarce, thus combining the major strengths of both public transport and private vehicles. Conventional public transport systems can present efficient space and energy consumption, whereas private vehicles have high levels of flexibility, are fast, and are always available.The proposed algorithm aims at assessing the potential demand of this new service by developing a clustering algorithm in which the groups of clients formed for each minibus route should present the following characteristics: there is a small number of boarding and exiting points, where in each point there is only boarding or alighting; boarding points should be close to each other, as well as the exiting points; there must be a reasonable distance between the last boarding point and the first exiting point; the average load factor must be high; and for all clients the overall detour time relative to the direct service should be small.This paper presents the rationale and structure of the clustering algorithm, followed by an application for the Lisbon metropolitan area during the morning peak, which could be adapted to the afternoon peak with some slight modifications.

Suggested Citation

  • L. Miguel Martínez & José Manuel Viegas & Tomás Eiró, 2015. "Formulating a New Express Minibus Service Design Problem as a Clustering Problem," Transportation Science, INFORMS, vol. 49(1), pages 85-98, February.
  • Handle: RePEc:inm:ortrsc:v:49:y:2015:i:1:p:85-98
    DOI: 10.1287/trsc.2013.0497
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2013.0497
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2013.0497?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
    ---><---

    References listed on IDEAS

    as
    1. Luis Ferreira & Phil Charles & Clara Tether, 2007. "Evaluating Flexible Transport Solutions," Transportation Planning and Technology, Taylor & Francis Journals, vol. 30(2-3), pages 249-269.
    2. Brake, Jenny & Mulley, Corinne & Nelson, John D. & Wright, Steve, 2007. "Key lessons learned from recent experience with Flexible Transport Services," Transport Policy, Elsevier, vol. 14(6), pages 458-466, November.
    3. Konstantinos Zografos & Konstantinos Androutsopoulos & Teemu Sihvola, 2008. "A methodological approach for developing and assessing business models for flexible transport systems," Transportation, Springer, vol. 35(6), pages 777-795, November.
    4. 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.
    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. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Griffin, Emily C. & Keskin, Burcu B. & Allaway, Arthur W., 2023. "Clustering retail stores for inventory transshipment," European Journal of Operational Research, Elsevier, vol. 311(2), pages 690-707.

    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. Jokinen, Jani-Pekka & Sihvola, Teemu & Mladenovic, Milos N., 2019. "Policy lessons from the flexible transport service pilot Kutsuplus in the Helsinki Capital Region," Transport Policy, Elsevier, vol. 76(C), pages 123-133.
    2. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    3. Zahra Navidi & Nicole Ronald & Stephan Winter, 2018. "Comparison between ad-hoc demand responsive and conventional transit: a simulation study," Public Transport, Springer, vol. 10(1), pages 147-167, May.
    4. Alan Lee & Martin Savelsbergh, 2017. "An extended demand responsive connector," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 25-50, March.
    5. Pietro Mariano & Marco Trolese & David Kastelec & Mateja Bitenc & Deja Jurgec, 2023. "Designing Mobility Policies for Vulnerable Users Employing the Living Lab Approach: Cases of a Demand-Responsive Transit Service in Ljubljana and Maribor," Sustainability, MDPI, vol. 15(20), pages 1-15, October.
    6. Velaga, Nagendra R. & Beecroft, Mark & Nelson, John D. & Corsar, David & Edwards, Peter, 2012. "Transport poverty meets the digital divide: accessibility and connectivity in rural communities," Journal of Transport Geography, Elsevier, vol. 21(C), pages 102-112.
    7. Hörcher, Daniel & Tirachini, Alejandro, 2021. "A review of public transport economics," Economics of Transportation, Elsevier, vol. 25(C).
    8. Franco, Patrizia & Johnston, Ryan & McCormick, Ecaterina, 2020. "Demand responsive transport: Generation of activity patterns from mobile phone network data to support the operation of new mobility services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 131(C), pages 244-266.
    9. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    10. 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.
    11. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    12. Shangyao Yan & Chun-Ying Chen, 2011. "An optimization model and a solution algorithm for the many-to-many car pooling problem," Annals of Operations Research, Springer, vol. 191(1), pages 37-71, November.
    13. Reinhardt, Line Blander & Clausen, Tommy & Pisinger, David, 2013. "Synchronized dial-a-ride transportation of disabled passengers at airports," European Journal of Operational Research, Elsevier, vol. 225(1), pages 106-117.
    14. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    15. 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.
    16. Alexandra König & Tabea Bonus & Jan Grippenkoven, 2018. "Analyzing Urban Residents’ Appraisal of Ridepooling Service Attributes with Conjoint Analysis," Sustainability, MDPI, vol. 10(10), pages 1-16, October.
    17. Dong, Xiaotong & Chow, Joseph Y.J. & Waller, S. Travis & Rey, David, 2022. "A chance-constrained dial-a-ride problem with utility-maximising demand and multiple pricing structures," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    18. 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.
    19. Aylin Kalpakcı & Neslihan Karataş Ünverdi, 2016. "Integration of paratransit systems with inner-city bus transport: the case of Izmir," Public Transport, Springer, vol. 8(3), pages 405-426, December.
    20. 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.

    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:inm:ortrsc:v:49:y:2015:i:1:p:85-98. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.