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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Published in:

    Publication date :

    2002-09-16


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    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