An improved multi-objective imperialist competitive algorithm for surgical case scheduling problem with switching and preparation times

一种改进的多目标帝国主义竞争算法,用于解决具有切换时间和准备时间的手术病例调度问题。

阅读:1

Abstract

Surgical case scheduling is a key issue in the field of medician, which is a challenging work because of the difficulty in assigning resources to patients. This study regards the surgical case scheduling problem as a flexible job shop scheduling problem (FJSP). Considering the switching and preparation time of patients in different stage, an improved multi-objective imperialist competitive algorithm (IMOICA), which adopts the non-dominant sorting method, is proposed to optimize the whole scheduling. First, the social hierarchy strategy is developed to initialize the empire. Then, to enhance the global search ability of the algorithm, the concept of attraction and repulsion (AR) is introduced into the assimilation strategy. Moreover, to increase the diversity of the population, the revolution strategy is utilized. Finally, the variable neighborhood search (VNS) strategy is embedded to improve its exploitation capacity further. Experiments show that scheduling in advance saves time and cost, and IMOICA can solve the surgical case scheduling problem studied efficiently.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。