This project is our work for the course EBM115A05.2018-2019 (OR Analysis of Complex Systems, i.e. ORACS) at the University of Groningen. The aim of this course is to solve a A Multi-Depot Dial-A-Ride Problem with Transfer Locations, which is an extension of Masson et al. (2014) by introducing optional transfers with associated opening costs.
We will use Adaptive Large Neighbourhood Search to tacle this problem. This method was pioneered by Ropke and Pissinger (2006) and is the same approach as Masson (2014) uses for a very similar problem.
For more detailed information, please see the paper that accompanies this project.
Masson, R., Lehuédé, F., and Péton, O. (2014). The Dial-A-Ride Problem with Transfers. Computers & Operations Research, 41:12–23
Ropke, S. and Pisinger, D. (2006). An Adaptive Large Neighborhood Search Heuristic for thePickup and Delivery Problem with Time Windows.Transportation Science, 40(4):455–472.