In this paper, a multi-depot dial-a-ride problem arising from a real-world healthcare application is addressed, concerning the non-emergency transportation of patients. The problem presents several constraints and features, such as heterogeneous vehicles, vehicle–patient compatibility constraints, quality of service requirements, patients׳ preferences, tariffs depending on the vehicles׳ waiting. Variable Neighborhood Search and Tabu Search algorithms are proposed able to tackle all the characteristics of the problem. A Mixed Integer Linear Programming formulation is also presented. Computational results on large real-world and random instances based on real data show the effectiveness of the proposed approaches.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare|
|Citazione:||Detti, P., Papalini, F., & ZABALO MANRIQUE DE LARA, G. (2017). A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. OMEGA, 70, 1-14.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: