A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare |
| |
| Institution: | 1. Research Group Logistics, Hasselt University, Agoralaan Gebouw D, 3590 Diepenbeek, Belgium;2. Research Foundation Flanders (FWO), Egmontstraat 5, 1000 Brussels, Belgium;3. CORMSIS Centre of Operational Research, Management Sciences and Information Systems, University of Southampton, Southampton, SO17 1BJ, UK;1. Urban Transport Systems Laboratory, School of Architecture, Civil and Environmental Engineering, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne CH-1015, Switzerland;2. Department of Industrial Engineering, Tel-Aviv University, Tel-Aviv 69978, Israel |
| |
| Abstract: | 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. |
| |
| Keywords: | Dial-a-ride problem Healthcare Variable neighborhood search Tabu search |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
