Scheduling ambulance crews for maximum coverage

Name: Scheduling ambulance crews for maximum coverage
Author: Erdoğan, Güneş, Erkut, Erhan, Ingolfsson, A., Laporte, G.

İsim	Scheduling ambulance crews for maximum coverage
Yazar	Erdoğan, Güneş, Erkut, Erhan, Ingolfsson, A., Laporte, G.
Basım Tarihi:	2010-04
Basım Yeri	- Palgrave MacMillan
Konu	Ambulance location, Shift scheduling, Tabu search, Integer programming
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0160-5682
Kayıt Numarası	3a35ba07-b102-41ab-9cbf-ef453184022f
Lokasyon	Business Administration, Industrial Engineering
Tarih	2010-04
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Scheduling ambulance crews for maximum coverage

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

Basım Tarihi 2010-04

Basım Yeri - Palgrave MacMillan

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

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0160-5682

Kayıt Numarası 3a35ba07-b102-41ab-9cbf-ef453184022f

Lokasyon Business Administration, Industrial Engineering

Tarih 2010-04

Örnek Metin 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