Improving the efficiency of demand-responsive paratransit services

被引:26
|
作者
Gupta, Diwakar [1 ]
Chen, Hao-Wei [1 ]
Miller, Lisa A. [1 ]
Surya, Fajarrani [1 ]
机构
[1] Univ Minnesota, Ind & Syst Engn Program, Minneapolis, MN 55455 USA
关键词
Paratransit services; Route optimization; Non-dedicated services; A-RIDE PROBLEM; DELIVERY PROBLEMS; PICKUP; ALGORITHMS; MODELS;
D O I
10.1016/j.tra.2010.01.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
State agencies responsible for ADA-eligible paratransit services are increasingly under pressure to contain costs and maximize service quality. Many do not operate vehicles themselves; instead, they contract out the provision of services. Contractors are paid for each hour of service. They are responsible for hiring crew, forming routes, dispatching, and operating and maintaining agency-owned vehicles. In the Twin Cities of Minneapolis and Saint Paul, Metro Mobility, the agency responsible for providing paratransit services, requires contractors to use agency-approved software for booking trips dynamically and sets parameters that guide contractors' practices. Customer trips booked in this fashion may not utilize capacity in the most efficient manner. Therefore, beginning with the daily trip schedules generated by the software, this paper proposes two approaches for improving the efficiency of paratransit operations and estimates the benefit of using these approaches via experiments that utilize Metro Mobility data. The first approach re-optimizes routes developed at the end of each day. The second approach evaluates the benefit to state agencies of selectively using non-dedicated service providers such as taxis. Both approaches are tested on actual data obtained from Metro Mobility. The study shows that a conservative estimate of savings from re-optimization would be approximately 5% of Metro Mobility's operating costs. Savings from the use of taxis are smaller and in the range of hundreds of dollars per day. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:201 / 217
页数:17
相关论文
共 50 条
  • [1] On demand forecasting of demand-responsive paratransit services with prior reservations
    Chandakas, Ektoras
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 120
  • [2] Optimizing Demand-Responsive Paratransit Operations: A Mixed Integer Programming Approach
    Zhang, Xiaojian
    Yang, Yu
    Cochran, Abigail L.
    McDonald, Noreen
    Zhao, Xilei
    [J]. 2021 55TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2021,
  • [3] Designing demand-responsive bus services for imbalanced demand
    Aktaş Dejaegere, Dilay
    [J]. 4OR, 2024, 22 (04) : 541 - 542
  • [4] A hierarchical task model for dispatching in computer-assisted demand-responsive paratransit operation
    Rahimi, M
    Dessouky, M
    [J]. ITS JOURNAL, 2001, 6 (03): : 199 - 223
  • [5] Towards the Goldilocks Zone of demand-responsive bus services
    Montenegro, Bryan David Galarza
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2024, 22 (01): : 175 - 176
  • [6] Joint optimisation of regular and demand-responsive transit services
    Zhao, Jing
    Sun, Sicheng
    Cats, Oded
    [J]. TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2023, 19 (02)
  • [7] Towards the Goldilocks Zone of demand-responsive bus services
    Bryan David Galarza Montenegro
    [J]. 4OR, 2024, 22 : 175 - 176
  • [8] Fleet scheduling and dispatching for demand-responsive passenger services
    Horn, MET
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2002, 10 (01) : 35 - 63
  • [9] Exploring the effects of mixed request schemes for demand-responsive feeder services
    Kelly, R.
    Ronald, N.
    Wallace, M.
    Winter, S.
    [J]. 21ST INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION (MODSIM2015), 2015, : 1731 - 1737
  • [10] Best Practices in Integrated Demand-Responsive Transport Services for People and Freight
    Ennas, Samuele
    Contu, Francesco
    Di Francesco, Massimo
    Maltinti, Francesca
    Zanda, Simone
    Garau, Chiara
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS-ICCSA 2024 WORKSHOPS, PT XI, 2024, 14825 : 73 - 94