Academic Editor: Youssef EL FOUTAYENI
Received |
Accepted |
Published |
January 30, 2021 |
February 15, 2021 |
March 15, 2021 |
Abstract: This presentation consists of solving an extension of the static Dial-A-Ride problem (DARP) by an effective iterated local search for the dial-a-ride problem with driver preferences. For that, we consider a set of drivers and a set of requests geographically dispersed. Each request is associated with an origin, a destination, pickup and delivery time windows, and a demand (number of passengers). In addition to the capacity of the vehicle which is limited to three passengers at the same time, the maximum duration of the whole trip, and the maximum duration not to be exceeded by each request ...