This paper describes an application of a Hybrid Algorithm based on the Multi-Objective Simulated Annealing-Tabu Search (MOSA-TS) to solve the dynamic Dial a Ride Problem (DRP). In fact, different versions of the dynamic Dial k Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and to solve the dynamic DRP in the application using a multi agent system based on Hybrid Algorithm: Multi-Objective Simulated Annealing-Tabu Search (MOSA-TS).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A hybrid approach based on Multi-Objective Simulated Annealing and Tabu Search to solve the Dynamic dial a Ride Problem


    Contributors:


    Publication date :

    2013-05-01


    Size :

    330208 byte




    Type of media :

    Conference paper


    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 tabu search heuristic for the static multi-vehicle dial-a-ride problem

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