GUO H, LU J B.A many objective patient scheduling evolutionary algorithm in hemodialysis service[J].Journal of Henan Polytechnic University(Natural Science) ,2023,42(5):154-160.

doi:10.16186/j.cnki.1673-9787.2021120090

Received:2021/12/24

Revised:2022/04/07

Published:2023/09/25

A many objective patient scheduling evolutionary algorithm in hemodialysis service

GUO Hua1, LU Jiongbing2

1.Anyang Preschool Teachers College，Anyang  455000，Henan，China;2.School of Artificial Intelligence and Automation，Huazhong University of Science and Technology，Wuhan  430074，Hubei，China

Abstract:The patient scheduling problem involved in hemodialysis has the characteristics of many-objective.In this paper，a many-objective patient scheduling problem was presented and analyzed.A clustering-based many-objective evolutionary algorithm was proposed，where an encoding schema was set for multi-level structure of a patient schedule，and a mechanism was designed for constructing a mating pool，following with some mutation and crossover operators.In the selection process，three alternative straegies were developed based on clustering.The numerical experiments were conducted with some instances extended with real-life case.The results showed that the algorithm could obtain better results，when the selection strategy was set as fast non-dominated sorting firstly，and clustering-based selecting with the factor of dominance area secondly.

Key words:hemodialysis service;patient scheduling;many-objective evolutionary algorithm;clustering

一种高维多目标血液透析服务患者调度进化算法_郭华.pdf