Back to Search

Scheduling ambulance crews for maximum coverage

Title	Scheduling ambulance crews for maximum coverage
Author	Erdoğan, Güneş, Erkut, Erhan, Ingolfsson, A., Laporte, G.
Publication Date:	2010-04
Publication Place	- Palgrave MacMillan
Subject	Ambulance location, Shift scheduling, Tabu search, Integer programming
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0160-5682
Record ID	3a35ba07-b102-41ab-9cbf-ef453184022f
Library Location	Business Administration, Industrial Engineering
Date	2010-04
Sample Text	This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented.
DOI	10.1057/jors.2008.163
Cilt	61

View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine

Özyeğin University

Scheduling ambulance crews for maximum coverage

Author Erdoğan, Güneş, Erkut, Erhan, Ingolfsson, A., Laporte, G.

Publication Date 2010-04

Publication Place - Palgrave MacMillan

Subject Ambulance location, Shift scheduling, Tabu search, Integer programming

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0160-5682

Record ID 3a35ba07-b102-41ab-9cbf-ef453184022f

Library Location Business Administration, Industrial Engineering

Date 2010-04

Sample Text This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented.

DOI 10.1057/jors.2008.163

Cilt 61