标题:A simple randomized variable neighbourhood search for nurse rostering
作者:Zheng, Ziran; Liu, Xiyu; Gong, Xiaoju
作者机构:[Zheng, Ziran; Liu, Xiyu] Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Shandong, Peoples R China.; [Gong, Xiaoju] Shandong Univ, S 更多
通讯作者:Zheng, Ziran
通讯作者地址:[Zheng, ZR]Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Shandong, Peoples R China.
来源:COMPUTERS & INDUSTRIAL ENGINEERING
出版年:2017
卷:110
页码:165-174
DOI:10.1016/j.cie.2017.05.027
关键词:Nurse rostering; Personnel scheduling; Variable neighbourhood search
摘要:Nurse rostering is a complex and hard discrete optimization problem as well as a very common personnel scheduling task which occurs in each hospital ward. To solve the highly constrained nurse rostering problem, various approaches have been developed including some effective variable neighbourhood search methods. In this paper, a randomized variable neighbourhood search algorithm, which is much simpler than existing methods of the similar type, is proposed. The algorithm uses random combined group operators to iteratively search better solutions and a cycle shift operator to diversify the search space when stagnating in local optima. Computational experiments are carried out with fifty-five instances from the First International Nurse Rostering Competition. Under the time limit of the competition, results achieved show that the proposed algorithm is very competitive with the state-of-the-art methods. Comparison of results with respect to the average performance with other algorithms indicates that our approach is more stable. Analysis and discussion based on extensive experiments are also presented to investigate critical features of our algorithm. (C) 2017 Elsevier Ltd. All rights reserved.
收录类别:EI;SCOPUS;SCIE
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020486130&doi=10.1016%2fj.cie.2017.05.027&partnerID=40&md5=3776c91d650d2e73ab914bccf23a18c6
TOP