AbstractThis article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable of accommodating all requests. Side constraints relate to vehicle capacity, route duration and the maximum ride time of any user. Extensive computational results are reported on randomly generated and real-life data sets.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A tabu search heuristic for the static multi-vehicle dial-a-ride problem


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2002-09-16


    Format / Umfang :

    16 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    GPU-Accelerated Tabu Search Algorithm for Dial-A-Ride Problem

    Pandi, Ramesh Ramasamy / Ho, Song Guang / Nagavarapu, Sarat Chandra et al. | IEEE | 2018


    A Granular Tabu Search algorithm for the Dial-a-Ride Problem

    Kirchler, Dominik | Online Contents | 2013


    A Granular Tabu Search algorithm for the Dial-a-Ride Problem

    Kirchler, Dominik / Wolfler Calvo, Roberto | Elsevier | 2013