A heuristic solution approach for the optimization of dynamic ridesharing systems

First published in
Operations Research Proceedings  
Number in series
2019
Start Page
733
End Page
739
Citation
Operations Research Proceedings 2019: 733-739 (2020-9-25)
Contribution to Conference
Annual International Conference of the German Operations Research Society (GOR 2019)  
Publisher DOI
10.1007/978-3-030-48439-2_89
Publisher
Springer
The key to a successful ridesharing service is an efficient allocation and routing of vehicles and customers. In this paper, relevant aspects from practice, like customer waiting times, are integrated into a mathematical programming model for the operational optimization of a dynamic ridesharing system, improving existing models from the literature. Moreover, a new heuristic solution method for the optimization of a dynamic ridepooling system is developed and compared with the exact solution derived by a MIP solver based on the above-mentioned model.In a case study consisting of 30 customers who request different rides and can be transported by a fleet of 10 vehicles in the area of Hamburg, both approaches are tested. The results show that the heuristic solution method is superior to the exact solution method, especially with respect to the required solution time.
DDC Class
330: Wirtschaft