This research focuses on the home health care optimization problem that involves staff routing and scheduling problems.The considered problem is an extension of multiple travelling salesman problem.It consists of find...This research focuses on the home health care optimization problem that involves staff routing and scheduling problems.The considered problem is an extension of multiple travelling salesman problem.It consists of finding the shortest path for a set of caregivers visiting a set of patients at their homes in order to perform various tasks during a given horizon.Thus,a mixed-integer linear programming model is proposed to minimize the overall service time performed by all caregivers while respecting the workload balancing constraint.Nevertheless,when the time horizon become large,practical-sized instances become very difficult to solve in a reasonable computational time.Therefore,a new Learning Genetic Algorithm for mTSP(LGA-mTSP)is proposed to solve the problem.LGA-mTSP is composed of a new genetic algorithm for mTSP,combined with a learning approach,called learning curves.Learning refers to that caregivers’productivity increases as they gain more experience.Learning curves approach is considered as a way to save time and costs.Simulation results show the efficiency of the proposed approach and the impact of learning curve strategy to reduce service times.展开更多
At present,home health care(HHC)has been accepted as an effective method for handling the healthcare problems of the elderly.The HHC scheduling and routing problem(HHCSRP)attracts wide concentration from academia and ...At present,home health care(HHC)has been accepted as an effective method for handling the healthcare problems of the elderly.The HHC scheduling and routing problem(HHCSRP)attracts wide concentration from academia and industrial communities.This work proposes an HHCSRP considering several care centers,where a group of customers(i.e.,patients and the elderly)require being assigned to care centers.Then,various kinds of services are provided by caregivers for customers in different regions.By considering the skill matching,customers’appointment time,and caregivers’workload balancing,this article formulates an optimization model with multiple objectives to achieve minimal service cost and minimal delay cost.To handle it,we then introduce a brain storm optimization method with particular multi-objective search mechanisms(MOBSO)via combining with the features of the investigated HHCSRP.Moreover,we perform experiments to test the effectiveness of the designed method.Via comparing the MOBSO with two excellent optimizers,the results confirm that the developed method has significant superiority in addressing the considered HHCSRP.展开更多
文摘This research focuses on the home health care optimization problem that involves staff routing and scheduling problems.The considered problem is an extension of multiple travelling salesman problem.It consists of finding the shortest path for a set of caregivers visiting a set of patients at their homes in order to perform various tasks during a given horizon.Thus,a mixed-integer linear programming model is proposed to minimize the overall service time performed by all caregivers while respecting the workload balancing constraint.Nevertheless,when the time horizon become large,practical-sized instances become very difficult to solve in a reasonable computational time.Therefore,a new Learning Genetic Algorithm for mTSP(LGA-mTSP)is proposed to solve the problem.LGA-mTSP is composed of a new genetic algorithm for mTSP,combined with a learning approach,called learning curves.Learning refers to that caregivers’productivity increases as they gain more experience.Learning curves approach is considered as a way to save time and costs.Simulation results show the efficiency of the proposed approach and the impact of learning curve strategy to reduce service times.
基金supported in part by the National Natural Science Foundation of China(Nos.62173356 and 61703320)the Science and Technology Development Fund(FDCT),Macao SAR(No.0019/2021/A)+3 种基金Shandong Province Outstanding Youth Innovation Team Project of Colleges and Universities(No.2020RWG011)Natural Science Foundation of Shandong Province(No.ZR202111110025)China Postdoctoral Science Foundation Funded Project(No.2019T120569)the Zhuhai Industry-University-Research Project with Hongkong and Macao(No.ZH22017002210014PWC).
文摘At present,home health care(HHC)has been accepted as an effective method for handling the healthcare problems of the elderly.The HHC scheduling and routing problem(HHCSRP)attracts wide concentration from academia and industrial communities.This work proposes an HHCSRP considering several care centers,where a group of customers(i.e.,patients and the elderly)require being assigned to care centers.Then,various kinds of services are provided by caregivers for customers in different regions.By considering the skill matching,customers’appointment time,and caregivers’workload balancing,this article formulates an optimization model with multiple objectives to achieve minimal service cost and minimal delay cost.To handle it,we then introduce a brain storm optimization method with particular multi-objective search mechanisms(MOBSO)via combining with the features of the investigated HHCSRP.Moreover,we perform experiments to test the effectiveness of the designed method.Via comparing the MOBSO with two excellent optimizers,the results confirm that the developed method has significant superiority in addressing the considered HHCSRP.
