布谷鸟搜索
解算器
布谷鸟
计算机科学
数学优化
调度(生产过程)
作业车间调度
整数规划
康复
算法
医学
数学
物理疗法
动物
操作系统
生物
粒子群优化
地铁列车时刻表
作者
Liyang Xiao,Mahjoub Dridi,Amir Hajjam El Hassani,Wanlong Lin,Hongying Fei
标识
DOI:10.1093/imaman/dpy009
摘要
Abstract In this study, we aim to minimize the total waiting time between successive treatments for inpatients in rehabilitation hospitals (departments) during a working day. Firstly, the daily treatment scheduling problem is formulated as a mixed-integer linear programming model, taking into consideration real-life requirements, and is solved by Gurobi, a commercial solver. Then, an improved cuckoo search algorithm is developed to obtain good quality solutions quickly for large-sized problems. Our methods are demonstrated with data collected from a medium-sized rehabilitation hospital in China. The numerical results indicate that the improved cuckoo search algorithm outperforms the real schedules applied in the targeted hospital with regard to the total waiting time of inpatients. Gurobi can construct schedules without waits for all the tested dataset though its efficiency is quite low. Three sets of numerical experiments are executed to compare the improved cuckoo search algorithm with Gurobi in terms of solution quality, effectiveness and capability to solve large instances.
科研通智能强力驱动
Strongly Powered by AbleSci AI