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

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.