Scheduling ambulance crews for maximum coverage / Erdogan, G. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Titre : Scheduling ambulance crews for maximum coverage Type de document : texte imprimé Auteurs : Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur Année de publication : 2010 Article en page(s) : pp. 543–550 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ambulance location Shift scheduling Tabu search Integer programming Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html [article] Scheduling ambulance crews for maximum coverage [texte imprimé] / Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur . - 2010 . - pp. 543–550. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Mots-clés : Ambulance location Shift scheduling Tabu search Integer programming Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire