In this paper, we study an extension of the well-known dial-a-ride problem with time windows. The aim is to design taxi routes to serve transportation requests each request is associated with a pickup and a delivery location. The problem is modeled as a dial-a-ride problem (DARP) with driver prefer-ences. In addition to the basics constraints for the (DARP), we consider that each driver can specify his destination at which time he wishes to end his trip. With the aim to minimize a weighted sum over total routing costs, the number of unserved requests, excess time to reach the destination of the driver. We propose a construction heuristic based on the location of drivers to solve this problem. Tested on randomly generated data, computational results show that the proposed construction heuristic can provide solutions with acceptable quality in a reasonable time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Construction heuristic for the dial-a-Ride problem with driver preferences


    Contributors:


    Publication date :

    2021-12-07


    Size :

    595265 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A dial-a-ride problem with driver preferences

    Ouasaid, Sana / Saddoune, Mohammed | IEEE | 2021


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

    Braekers, Kris | Online Contents | 2016



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

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