The dial-a-ride problem (DARP) is an NP-Hard problem related to transportation on demand, that consists in a set of requests for pick-up and delivery from passengers that need to be served by a limited set of available vehicles. In this paper, We study a static version of DARP with a time window. The goal is to determine an optimized route for taxis in order to serve passengers. Using an objective function that imposes penalties to assess the preferences of passengers, taking into account the driver’s preferences to reach a specific destination at a specific time. For our tests, we generated instances derived from standard DARP instances. A solution approach based on the ILS algorithm is presented and applied to solve these instances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A dial-a-ride problem with driver preferences


    Contributors:


    Publication date :

    2021-05-19


    Size :

    1800908 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    A multi-period dial-a-ride problem with driver consistency

    Braekers, Kris | Online Contents | 2016


    Dial-a-Ride

    Jørgensen, Rene Munk | BASE | 2003

    Free access

    The dial-a-ride problem: models and algorithms

    Cordeau, Jean-François / Laporte, Gilbert | Springer Verlag | 2007