Documents disponibles écrits par cet auteur

A scatter search methodology for the nurse rostering problem / Burke, E. K. in Journal of the operational research society (JORS), Vol. 61 N° 11 (Novembre 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1667–1679 Titre : A scatter search methodology for the nurse rostering problem Type de document : texte imprimé Auteurs : Burke, E. K., Auteur ; Curtois, T., Auteur ; Qu, R., Auteur Année de publication : 2011 Article en page(s) : pp. 1667–1679 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Nurse  rostering  Scatter  search  Heuristics Index. décimale : 001.424 Résumé : The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009118a.html [article] A scatter search methodology for the nurse rostering problem [texte imprimé] / Burke, E. K., Auteur ; Curtois, T., Auteur ; Qu, R., Auteur . - 2011 . - pp. 1667–1679. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1667–1679 Mots-clés : Nurse  rostering  Scatter  search  Heuristics Index. décimale : 001.424 Résumé : The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009118a.html

Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods / Xu, Y. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 313–325 Titre : Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods Type de document : texte imprimé Auteurs : Xu, Y., Auteur ; Qu, R., Auteur Année de publication : 2011 Article en page(s) : pp. 313–325 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multi-objective  optimisation  Evolutionary  multi-objective  simulated  annealing  Variable  neighbourhood  search  Multicast  routing Index. décimale : 001.424 Résumé : This paper presents the investigation of an evolutionary multi-objective simulated annealing (EMOSA) algorithm with variable neighbourhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighbourhood search to find more non-dominated solutions in the Pareto front. Different neighbourhood strictures have been designed with regard to the set of objectives, aiming to drive the search towards optimising all objectives simultaneously. A large number of simulations have been carried out on benchmark instances and random networks with real world features including cost, delay and link utilisations. Experimental results demonstrate that the proposed EMOSA algorithm with variable neighbourhoods is able to find high-quality non-dominated solutions for the problems tested. In particular, the neighbourhood structures that are specifically designed for each objective significantly improved the performance of the proposed algorithm compared with variants of the algorithm with a single neighbourhood. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010138a.html [article] Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods [texte imprimé] / Xu, Y., Auteur ; Qu, R., Auteur . - 2011 . - pp. 313–325. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 313–325 Mots-clés : Multi-objective  optimisation  Evolutionary  multi-objective  simulated  annealing  Variable  neighbourhood  search  Multicast  routing Index. décimale : 001.424 Résumé : This paper presents the investigation of an evolutionary multi-objective simulated annealing (EMOSA) algorithm with variable neighbourhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighbourhood search to find more non-dominated solutions in the Pareto front. Different neighbourhood strictures have been designed with regard to the set of objectives, aiming to drive the search towards optimising all objectives simultaneously. A large number of simulations have been carried out on benchmark instances and random networks with real world features including cost, delay and link utilisations. Experimental results demonstrate that the proposed EMOSA algorithm with variable neighbourhoods is able to find high-quality non-dominated solutions for the problems tested. In particular, the neighbourhood structures that are specifically designed for each objective significantly improved the performance of the proposed algorithm compared with variants of the algorithm with a single neighbourhood. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010138a.html