Skip to main content
Top
Published in: BMC Health Services Research 1/2016

Open Access 01-12-2016 | Research Article

Analysis of the impact of different service levels on the workload of an ambulance service provider

Authors: Marco Oberscheider, Patrick Hirsch

Published in: BMC Health Services Research | Issue 1/2016

Login to get access

Abstract

Background

Efficient transport of non-emergency patients is crucial for ambulance service providers to cope with increased demand resulting from aging Western societies. This paper deals with the optimization of the patient transport operations of the Red Cross of Lower Austria, which is the main provider in this state. Different quality levels of the provided service - expressed by time windows, feasible maximum ride times and exclusive transports - are tested and analyzed on real-life instances to show daily impacts on the provider’s resources. Comparisons of the developed solution approach to the recorded manual schedule prove its advantages. In contrast to previous work in this field, non-static service times that depend on the combination of patients, their transport mode, the vehicle type as well as the pickup or delivery locations are used. These service times are based on statistical analyses that have been performed on an anonymized dataset with more than 600,000 requests.

Methods

To solve the given problem, a matheuristic solution approach was developed that deals with the exact optimization of combinations of requests as a first stage. Subsequently, the identified combinations are used as an input into a Tabu Search strategy, where the vehicle routing is optimized. Three representative days of the year 2012 were chosen for the four regions of Lower Austria to test five different service levels and the quality of the solution method.

Results

For the standard scenario, the operation time of the manual schedule is reduced in the range from 14.1 % to 19.8 % for all tested instances. Even in the best service scenario, the matheuristic computes better results than the manual schedule. The service level has a high impact on the operation time of providers. The relative savings that are achieved by the algorithm are significantly lowered by introducing higher quality standards. The main reason is that less feasible combinations of patients can be generated. This leads to diminished opportunities for patients to be transported at the same time. The results indicate that the implementation of the developed matheuristic in daily planning decisions could decrease operation times significantly.

Conclusions

Managers have to define minimum standards for the punctuality, exclusive transports and excess ride times. This is crucial in order to find a suitable compromise between the service level and an optimized resource management.
Literature
3.
go back to reference Sterud T, Hem E, Ekeberg Ø, Lau B. Health problems and help-seeking in a nationwide sample of operational norwegian ambulance personnel. BMC Public Health. 2008; 8:3.CrossRefPubMedPubMedCentral Sterud T, Hem E, Ekeberg Ø, Lau B. Health problems and help-seeking in a nationwide sample of operational norwegian ambulance personnel. BMC Public Health. 2008; 8:3.CrossRefPubMedPubMedCentral
4.
go back to reference Hansen CD, Rasmussen K, Kyed M, Nielsen KJ, Andersen J. Physical and psychosocial work environment factors and their association with health outcomes in danish ambulance personnel – a cross-sectional study. BMC Public Health. 2012; 12:534.CrossRefPubMedPubMedCentral Hansen CD, Rasmussen K, Kyed M, Nielsen KJ, Andersen J. Physical and psychosocial work environment factors and their association with health outcomes in danish ambulance personnel – a cross-sectional study. BMC Public Health. 2012; 12:534.CrossRefPubMedPubMedCentral
6.
go back to reference Braekers K, Caris A, Janssens GK. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp Res B-Meth. 2014; 67:166–86.CrossRef Braekers K, Caris A, Janssens GK. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp Res B-Meth. 2014; 67:166–86.CrossRef
7.
go back to reference Borndörfer R, Grötschel M, Klostermeier F, Küttner C. Telebus berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany. 1997. Borndörfer R, Grötschel M, Klostermeier F, Küttner C. Telebus berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany. 1997.
8.
go back to reference Parragh S, Cordeau JF, Doerner KF, Hartl RF. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum. 2012; 34(3):593–633.CrossRef Parragh S, Cordeau JF, Doerner KF, Hartl RF. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum. 2012; 34(3):593–633.CrossRef
9.
go back to reference Paquette J, Cordeau JF, Laporte G, Pascoal MMB. Combining multicriteria analysis and tabu search for dial-a-ride problems. Transp Res B-Meth. 2013; 52:1–16.CrossRef Paquette J, Cordeau JF, Laporte G, Pascoal MMB. Combining multicriteria analysis and tabu search for dial-a-ride problems. Transp Res B-Meth. 2013; 52:1–16.CrossRef
10.
go back to reference Cordeau JF, Laporte G. The dial-a-ride problem: models and algorithms. Ann Oper Res. 2007; 153(1):29–46.CrossRef Cordeau JF, Laporte G. The dial-a-ride problem: models and algorithms. Ann Oper Res. 2007; 153(1):29–46.CrossRef
11.
go back to reference Parragh S, Doerner KF, Hartl RF. A survey on pickup and delivery problems. part i: Transportation between customers and depot. J Betriebswirtsch. 2008; 58(1):21–51.CrossRef Parragh S, Doerner KF, Hartl RF. A survey on pickup and delivery problems. part i: Transportation between customers and depot. J Betriebswirtsch. 2008; 58(1):21–51.CrossRef
12.
go back to reference Parragh S, Doerner KF, Hartl RF. A survey on pickup and delivery problems. part ii: transportation between pickup and delivery locations. J Betriebswirtsch. 2008; 58(2):81–117.CrossRef Parragh S, Doerner KF, Hartl RF. A survey on pickup and delivery problems. part ii: transportation between pickup and delivery locations. J Betriebswirtsch. 2008; 58(2):81–117.CrossRef
13.
go back to reference Parragh S, Doerner KF, Hartl RF. Variable neighborhood search for the dial-a-ride problem. Comput Oper Res. 2010; 37(6):1129–1138.CrossRef Parragh S, Doerner KF, Hartl RF. Variable neighborhood search for the dial-a-ride problem. Comput Oper Res. 2010; 37(6):1129–1138.CrossRef
14.
15.
go back to reference Melachrinoudis E, Ilhan AB, Min H. A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res. 2007; 34(3):742–59.CrossRef Melachrinoudis E, Ilhan AB, Min H. A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res. 2007; 34(3):742–59.CrossRef
16.
go back to reference Carnes TA, Henderson SG, Shmoys DB, Ahghari M, MacDonald RD. Mathematical programming guides air-ambulance routing at ornge. Interfaces. 2013; 43(3):232–9.CrossRef Carnes TA, Henderson SG, Shmoys DB, Ahghari M, MacDonald RD. Mathematical programming guides air-ambulance routing at ornge. Interfaces. 2013; 43(3):232–9.CrossRef
17.
go back to reference Xiang Z, Chu C, Chen H. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur J Oper Res. 2006; 174(2):1117–39.CrossRef Xiang Z, Chu C, Chen H. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur J Oper Res. 2006; 174(2):1117–39.CrossRef
18.
go back to reference Cordeau JF, Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res Part B. 2003; 37:579–94.CrossRef Cordeau JF, Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res Part B. 2003; 37:579–94.CrossRef
19.
go back to reference Kirchler D, Wolfler Calvo R. A granular tabu search algorithm for the dial-a-ride problem. Transp Res B-Meth. 2013; 56:120–35.CrossRef Kirchler D, Wolfler Calvo R. A granular tabu search algorithm for the dial-a-ride problem. Transp Res B-Meth. 2013; 56:120–35.CrossRef
20.
go back to reference Parragh S. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp Res C-Emer. 2011; 19(5):912–30.CrossRef Parragh S. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp Res C-Emer. 2011; 19(5):912–30.CrossRef
21.
go back to reference Wong KI, Bell MGH. Solution of the dial-a-ride problem with multi-dimensional capacity constraints. Int T Oper Res. 2006; 13(3):195–208.CrossRef Wong KI, Bell MGH. Solution of the dial-a-ride problem with multi-dimensional capacity constraints. Int T Oper Res. 2006; 13(3):195–208.CrossRef
22.
go back to reference Archetti C, Speranza MG. A survey on matheuristics for routing problems. EURO J Comput Optim. 2014; 2(4):223–46.CrossRef Archetti C, Speranza MG. A survey on matheuristics for routing problems. EURO J Comput Optim. 2014; 2(4):223–46.CrossRef
23.
go back to reference Paquette J, Cordeau JF, Laporte G. Quality of service in dial-a-ride operations. Comput Ind Eng. 2009; 56:1721–34.CrossRef Paquette J, Cordeau JF, Laporte G. Quality of service in dial-a-ride operations. Comput Ind Eng. 2009; 56:1721–34.CrossRef
24.
go back to reference Paquette J, Bellavance F, Cordeau JF, Laporte G. Measuring quality of service in dial-a-ride operations: the case of a canadian city. Transportation. 2012; 39(3):539–64.CrossRef Paquette J, Bellavance F, Cordeau JF, Laporte G. Measuring quality of service in dial-a-ride operations: the case of a canadian city. Transportation. 2012; 39(3):539–64.CrossRef
25.
go back to reference Luo Y, Schonfeld P. A rejected-reinsertion heuristic for the static dial-a-ride problem. Transp Res B-Meth. 2007; 41(7):736–55.CrossRef Luo Y, Schonfeld P. A rejected-reinsertion heuristic for the static dial-a-ride problem. Transp Res B-Meth. 2007; 41(7):736–55.CrossRef
26.
go back to reference Cordeau JF, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc. 2001; 52:928–36.CrossRef Cordeau JF, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc. 2001; 52:928–36.CrossRef
27.
go back to reference Savelsbergh MWP. The vehicle routing problem with time windows: Minimizing route duration. Orsa J Comput. 1992; 4(2):146–54.CrossRef Savelsbergh MWP. The vehicle routing problem with time windows: Minimizing route duration. Orsa J Comput. 1992; 4(2):146–54.CrossRef
28.
go back to reference Karabuk S. A nested decomposition approach for solving the paratransit vehicle scheduling problem. Transp Res B-Meth. 2009; 43:448–65.CrossRef Karabuk S. A nested decomposition approach for solving the paratransit vehicle scheduling problem. Transp Res B-Meth. 2009; 43:448–65.CrossRef
Metadata
Title
Analysis of the impact of different service levels on the workload of an ambulance service provider
Authors
Marco Oberscheider
Patrick Hirsch
Publication date
01-12-2016
Publisher
BioMed Central
Published in
BMC Health Services Research / Issue 1/2016
Electronic ISSN: 1472-6963
DOI
https://doi.org/10.1186/s12913-016-1727-5

Other articles of this Issue 1/2016

BMC Health Services Research 1/2016 Go to the issue