Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints Parragh, Sophie N ; Cordeau, Jean-Francois ; Doerner, Karl F ; Hartl, Richard F
Publication details: Montreal Interuniversitary Research Centre on Enterprise Networks, Logistics and Transportation, CIRRELT. CIRRELT-2010-13, 2010Description: 29 sSubject(s): Online resources: Abstract: This paper introduces models and algorithms for a dial-a-ride problem arising in the transportation of patients by non-profit organizations such as the Austrian Red Cross. This problem is characterized by the presence of heterogeneous vehicles and patients. In the studied problem, two types of vehicles are used, each providing a different capacity for four different modes of transportation. Patients may request to be transported either seated, on a stretcher or in a wheelchair. In addition, some may require accompanying persons. The problem is to construct a minimum-cost routing plan satisfying service related criteria. expressed in terms of time windows, as well as driver related constraints expressed in terms of maximum route duration limits and mandatory lunch breaks. The authors introduce both a three-index and a set partitioning formulation of the problem.This paper introduces models and algorithms for a dial-a-ride problem arising in the transportation of patients by non-profit organizations such as the Austrian Red Cross. This problem is characterized by the presence of heterogeneous vehicles and patients. In the studied problem, two types of vehicles are used, each providing a different capacity for four different modes of transportation. Patients may request to be transported either seated, on a stretcher or in a wheelchair. In addition, some may require accompanying persons. The problem is to construct a minimum-cost routing plan satisfying service related criteria. expressed in terms of time windows, as well as driver related constraints expressed in terms of maximum route duration limits and mandatory lunch breaks. The authors introduce both a three-index and a set partitioning formulation of the problem.