The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pickup and delivery requests between origins and destinations. The aim is to plan a set of m minimum cost vehicle routes capable of accommodating as many users as possible, under a set of constraints. The most common example arises in door-to-door transportation for elderly or disabled people. The purpose of this article is to review the scientific literature on the DARP. The main features of the problem are described and a summary of the most important models and algorithms is provided.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The dial-a-ride problem: models and algorithms


    Additional title:

    Ann Oper Res


    Contributors:

    Published in:

    Publication date :

    2007-09-01


    Size :

    18 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    MILP models for the Dial-a-ride problem with transfers

    Jacopo Pierotti / J. Theresia van Essen | DOAJ | 2021

    Free access

    Dial-a-Ride

    Jørgensen, Rene Munk | BASE | 2003

    Free access

    Scheduling Algorithms for a Dial-A-Ride System

    N. H. M. Wilson / J. M. Sussman / H. K. Wong et al. | NTIS | 1971



    Dial-a-Ride Services

    Community Transport Association | British Library Conference Proceedings | 1993