Optimization of Duties Assignment in Emergency Services

Author

Gilberti, Daniele ; Righini, Giovanni

Author_Institution

Graduate student, Department of Information Technologies, University of Milan, Via Bramante 65, 26013 Crema, Italy, e-mail: dgilberti@crema.unimi.it

fYear

2007

fDate

27-29 Aug. 2007

Firstpage

1

Lastpage

6

Abstract

We introduce the problem of assigning alert duties to emergency service providers, namely civil protection teams and heart surgery wards in order to evenly distribute the workload among all providers and to optimize the level of service, measured by the intervention time. We compare two different exact optimization methods to solve this kind of problems, one based on general purpose integer linear programming solvers and the other based on Lagrangean relaxation and branch-and-bound. We also present a GRASP heuristic and we show how it can be used in combination with the general-purpose solver. Experimental results are presented on instances adapted from the O.R. Library and on instances taken from real applications.

Keywords

Cities and towns; Emergency services; Heart; Hospitals; Integer linear programming; Lagrangian functions; Mathematical programming; Protection; Surgery; Time measurement; Integer linear programming; Lagrangean relaxation; Mathematical programming; Services optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Operations and Logistics, and Informatics, 2007. SOLI 2007. IEEE International Conference on

Conference_Location

Philadelphia, PA, USA

Print_ISBN

978-1-4244-1118-4

Electronic_ISBN

978-1-4244-1118-4

Type

conf

DOI

10.1109/SOLI.2007.4383865

Filename

4383865