By Topic

Optimization of Duties Assignment in Emergency Services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daniele Gilberti ; Graduate student, Department of Information Technologies, University of Milan, Via Bramante 65, 26013 Crema, Italy, e-mail: ; Giovanni Righini

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.

Published in:

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

Date of Conference:

27-29 Aug. 2007