کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
474895 699166 2007 25 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
چکیده انگلیسی

To the best of our knowledge, this paper describes the first ant colony optimization (ACO) approach applied to nurse scheduling, analyzing a dynamic regional problem which is currently under discussion at the Vienna hospital compound. Each day, pool nurses have to be assigned for the following days to public hospitals while taking into account a variety of soft and hard constraints regarding working date and time, working patterns, nurses qualifications, nurses’ and hospitals’ preferences, as well as costs. Extensive computational experiments based on a four week simulation period were used to evaluate three different scenarios varying the number of nurses and hospitals for six different hospitals’ demand intensities. The results of our simulations and optimizations reveal that the proposed ACO algorithm achieves highly significant improvements compared to a greedy assignment algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 34, Issue 3, March 2007, Pages 642–666
نویسندگان
, ,