Highlights Granular Tabu Search for the static Dial-a-Ride Problem. Optimization of number of passengers served, quality of service and operation costs. Granular neighborhood constructed by solving an assignment problem. Good results in 2–3min of computation time.

    Abstract In a Dial-a-Ride system, a fleet of vehicles without fixed routes and schedules carries people from their pick-up point to their delivery point. Pre-specified time windows must be respected, and service levels for passengers as well as operation costs should be optimized. The resulting routing and scheduling problem is NP -hard and can be modeled by a mixed integer linear programming formulation. In this paper, we propose a Granular Tabu Search algorithm for the static Dial-a-Ride Problem with the objective of producing good solutions in a short amount of time (up to 3min). We evaluate the algorithm on test instances from the literature. Our new algorithm performs well in comparison with a classical Tabu Search algorithm, a Genetic Algorithm, and a Variable Neighborhood Search.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2013-07-30


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




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

    Kirchler, Dominik | Online Contents | 2013


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

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


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

    Cordeau, Jean-François / Laporte, Gilbert | Elsevier | 2002



    Combining multicriteria analysis and tabu search for dial-a-ride problems

    Paquette, Julie / Cordeau, Jean-François / Laporte, Gilbert et al. | Elsevier | 2013