This article examines a partially responsive ride-sharing transit service with predetermined cyclic routes and deterministic travel times. The main operational challenge is setting the time schedule, which varies from day to day in response to upfront passenger requests. The need of passengers to adjust their departure times from their desired value causes inconvenience, which we wish to minimize. A previous study of the fixed route dial a ride problem (FRDARP) considered strict fleet constraints. We  solve two relaxed formulations, related to the one-dimensional p-median location problem, by efficient dynamic programming embedding the SMAWK algorithm. Numerical results show the potential benefit of the FRDARP compared to fixed schedule (traditional) service and illustrate the impact of demand level and fleet constraints. In addition, based on these results, we characterize the wide range of scenarios where an easier to solve relaxed formulation can be nearly as useful as the constrained formulation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Relaxation methods for fixed route demand responsive transit


    Contributors:

    Published in:

    Publication date :

    2022-12-31


    Size :

    27 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Comparing Fixed-Route and Demand-Responsive Feeder Transit Systems in Real-World Settings

    Edwards, Derek / Watkins, Kari | Transportation Research Record | 2013




    Flexible Route Optimization for Demand-Responsive Public Transit Service

    Huang, Ailing / Dou, Ziqi / Qi, Liuzi et al. | ASCE | 2020


    A methodology for comparing distances traveled by performance-equivalent fixed-route and demand responsive transit services

    Diana, Marco / Quadrifoglio, Luca / Pronello, Cristina | Taylor & Francis Verlag | 2009