A Bi-objective Home Care Worker Scheduling Problem Considering Lunch Break of Caregivers under Synchronized Service
In the process of home health care,patients with limited mobility often need two caregivers to serve them at the same time,which greatly increases the difficulty of the problem.In order to realize the cost reduction and efficiency increase of home health care enterprises and provide reference for managers'actual scheduling,a model was established.This model focused on the synchronized service demand of patients and considered the lunch break time of caregivers,with the aim of minimizing both operating costs and caregiver dissatisfaction.The expression of caregivers'dissatisfaction considered two aspects:degraded service and synchronized service time difference.To deal with the lunch break constraint,a virtual lunch break node was proposed.An improved adaptive large neighborhood search algorithm was proposed to solve the problem.The algorithm was combined with the multi-directional local search framework.A variety of heuristic initial solution strategies were adopted and the feasibility of the solution was verified by the synchronous service judgment matrix.Further,local search operators were devised for the two objectives to improve the quality of the solution.The Taguchi method was employed to adjust algorithm parameters and the solution set was evaluated using the hyper volume index and spacing metric index.Compared with three other multi-objective heuristic methods,the proposed algorithm achieved better evaluation index values in most examples.This validates the effectiveness and applicability of our algorithm in solving the home health care scheduling problem.
synchronized serviceshome health carelunch breakscaregiver dissatisfactionALNS
万方数据
维普
