This lecture proposed a multi-objective home healthcare routing planning problem considering a complex uncertain scenario, which takes into account three uncertain parameters. The model considers the case of clients with varying numbers of multiple time windows and optimizes three objectives. Then we proposed the improved multi-task constrained multi-objective optimization algorithm (MC-LS-MTCMO) to solve the model. Experimental results show that the algorithm can provide a large number of feasible non-dominated solutions for decision-makers to choose from. By comparing with MTCMO, and NSGA-II algorithms, it is shown that the algorithm can obtain a larger number of feasible nondominated solutions with good diversity, convergence, and distribution.