Sen Ngoc Vu, Minh H. Nhat Nguyen, Minh-Duc Le, C. Baril, V. Gascon, T. Dinh
{"title":"护士名册问题的迭代局部搜索","authors":"Sen Ngoc Vu, Minh H. Nhat Nguyen, Minh-Duc Le, C. Baril, V. Gascon, T. Dinh","doi":"10.1145/2542050.2542093","DOIUrl":null,"url":null,"abstract":"This paper presents how to solve a nurse rostering problem over the real datasets of Centre hospitalier régional de Trois-Rivières hospital in Canada. Due to the complexity of this problem with plenty of hard constraints, we propose an advanced Iterated Local Search, combining Tabu Search with 2 moves: Single Shift Move and Worst-Scheduled Nurse Swap. Greedy Shuffling with Steepest Descent is also used to improve the solution. Experimental results of our proposed algorithm on 5 real datasets improve the current schedules provided by the hospital. Our experimental results satisfy all of the hard constraints and objectives.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Iterated local search in nurse rostering problem\",\"authors\":\"Sen Ngoc Vu, Minh H. Nhat Nguyen, Minh-Duc Le, C. Baril, V. Gascon, T. Dinh\",\"doi\":\"10.1145/2542050.2542093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents how to solve a nurse rostering problem over the real datasets of Centre hospitalier régional de Trois-Rivières hospital in Canada. Due to the complexity of this problem with plenty of hard constraints, we propose an advanced Iterated Local Search, combining Tabu Search with 2 moves: Single Shift Move and Worst-Scheduled Nurse Swap. Greedy Shuffling with Steepest Descent is also used to improve the solution. Experimental results of our proposed algorithm on 5 real datasets improve the current schedules provided by the hospital. Our experimental results satisfy all of the hard constraints and objectives.\",\"PeriodicalId\":246033,\"journal\":{\"name\":\"Proceedings of the 4th Symposium on Information and Communication Technology\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 4th Symposium on Information and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2542050.2542093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2542050.2542093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents how to solve a nurse rostering problem over the real datasets of Centre hospitalier régional de Trois-Rivières hospital in Canada. Due to the complexity of this problem with plenty of hard constraints, we propose an advanced Iterated Local Search, combining Tabu Search with 2 moves: Single Shift Move and Worst-Scheduled Nurse Swap. Greedy Shuffling with Steepest Descent is also used to improve the solution. Experimental results of our proposed algorithm on 5 real datasets improve the current schedules provided by the hospital. Our experimental results satisfy all of the hard constraints and objectives.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
