Improving Sharing Rates of a Dial-a-Ride Problem implemented for an Austrian Mobility Provider
Author(s) -
Philipp Hungerländer,
Kerstin Maier,
Veronika Pachatz,
Christian Truden
Publication year - 2021
Publication title -
transportation research procedia
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.657
H-Index - 40
eISSN - 2352-1465
pISSN - 2352-1457
DOI - 10.1016/j.trpro.2021.01.062
Subject(s) - public transport , transport engineering , service provider , computer science , set (abstract data type) , point (geometry) , service (business) , work (physics) , order (exchange) , operations research , business , marketing , engineering , finance , mathematics , mechanical engineering , geometry , programming language
The Dial-a-Ride Problem (DARP) aims to find a set of minimal cost tours for passenger vehicles in order to satisfy a set of transport requests. Each request requires to pick up one or more passengers at a defined pick-up point and then drop off the passengers at the desired destination. In this work, we consider a DARP that has been implemented for an Austrian mobility provider. The company focuses on rural regions that suffer from insufficient public transportation and offers a sustainable form of mobility. The provider is especially interested in improving the sharing rates of the mobility service. Therefore, we propose a Large Neighborhood Search for solving the respective DARP. In a computational study, we compare different configurations of the service and identify the most promising configurations regarding sharing rates, passenger convenience and, hence, the overall efficiency of the service.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom