Consultation sequencing of a hospital with multiple service points using genetic programming
Consultation sequencing of a hospital with multiple service points using genetic programming
复制标题
DOI：
10.1080/0305215x.2018.1431233
复制
发表时间：
2018-02
影响因子：
2.7
通讯作者：
K. Morikawa;Katsuhiko Takahashi;Keisuke Nagasawa
中科院分区：
文献类型：
--
作者：
K. Morikawa;Katsuhiko Takahashi;Keisuke Nagasawa
摘要 对一家拥有一间由一名医生操作的诊室和几间检查室的医院进行了调查。预约的病人和预约的病人到达医院后，每个病人都会先去咨询室，其中一些病人会先去其他服务点再向医生咨询。目标函数由三个加权平均等待时间之和组成。对患者进行会诊排序的问题成为焦点。为了缓解等待的压力，会显示咨询顺序。使用调度规则来决定顺序，并通过遗传编程（GP）探索最佳规则。仿真实验表明，GP产生的规则可以简化为简单的队列排列，并且最佳排列取决于目标函数中使用的权重。这意味着可以通过对三个队列之间的优先级进行排序来实现等待时间的平衡分配。
ABSTRACT A hospital with one consultation room operated by a physician and several examination rooms is investigated. Scheduled patients and walk-ins arrive at the hospital, each patient goes to the consultation room first, and some of them visit other service points before consulting the physician again. The objective function consists of the sum of three weighted average waiting times. The problem of sequencing patients for consultation is focused. To alleviate the stress of waiting, the consultation sequence is displayed. A dispatching rule is used to decide the sequence, and best rules are explored by genetic programming (GP). The simulation experiments indicate that the rules produced by GP can be reduced to simple permutations of queues, and the best permutation depends on the weight used in the objective function. This implies that a balanced allocation of waiting times can be achieved by ordering the priority among three queues.