IMPROVED MEMETIC ALGORITHM FOR SOLVING A MULTI-LEVEL HOME HEALTH CARE ROUTING AND SCHEDULING PROBLEM WITH LUNCH BREAKS
Aiming at the constraints of caregivers' skill levels and lunch breaks,the model was established with the minimum operating cost.A hybrid initialization strategy and an adaptive neighborhood search structure were designed to improve the memetic algorithm,and the Taguchi method was used to adjust the algorithm parameters.The test results verify the effectiveness of the algorithm.Compared with the random neighborhood search method,the results show that the adaptive neighborhood search improves the convergence of the algo-rithm.The sensitivity analysis of lunch breaks duration and multi-level caregiver structure respectively proves the role of appropriate nap duration in reducing costs and the importance of introducing multi-level caregiver to the problem.
home health carelunch breaksmemetic algorithmadaptive neighborhood searchTaguchi methodFriedman test
万方数据
维普
