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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A dial-a-ride problem with driver preferences


    Beteiligte:


    Erscheinungsdatum :

    19.05.2021


    Format / Umfang :

    1800908 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




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

    Braekers, Kris | Online Contents | 2016


    Dial-a-Ride

    Jørgensen, Rene Munk | BASE | 2003

    Freier Zugriff

    The dial-a-ride problem: models and algorithms

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