P. Armbrust, V. Pachatz, K. Maier, P. Hungerländer

The Dial-a-Ride Problem (DARP) aims to find a set of minimal cost tours for a heterogeneous fleet of vehicles in order to satisfy a set of transport requests.
Further restrictions, namely customer chosen time window sizes, pick-up and drop-off locations, and capacity constraints are generally customary.
A common example arises in door-to-door transportation of people, especially elderly people or people with impaired mobility.
In this work, we consider a dynamic-deterministic variant of the DARP for two Austrian mobility providers that focus on rural regions.
As additional conditions, we take the transportation of people with impaired mobility, break times, and the capacity of wheelchairs into account.
We consider a heuristically and an exact solution approach, namely a Large Neighborhood Search and a Mixed-Integer Linear Programming approach.
In a computational study, we show different operator scenarios including minimizing overall driven kilometers, number of used vehicles, and number of unscheduled requests.

Keywords: Dial-a-Ride Problem, Large Neighborhood Search, Vehicle Routing


FA3 Routing
June 11, 2021  9:15 AM
3 - TC Koopmans

Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.