The dial-a-ride problem (DARP) is an NP-Hard problem related to transportation on demand, that consists in a set of requests for pick-up and delivery from passengers that need to be served by a limited set of available vehicles. In this paper, We study a static version of DARP with a time window. The goal is to determine an optimized route for taxis in order to serve passengers. Using an objective function that imposes penalties to assess the preferences of passengers, taking into account the driver’s preferences to reach a specific destination at a specific time. For our tests, we generated instances derived from standard DARP instances. A solution approach based on the ILS algorithm is presented and applied to solve these instances.
A dial-a-ride problem with driver preferences
2021-05-19
1800908 byte
Conference paper
Electronic Resource
English
A multi-period dial-a-ride problem with driver consistency
Online Contents | 2016
|The dial-a-ride problem: models and algorithms
Springer Verlag | 2007
|NTIS | 1974