A Heuristic Logic-Based Benders Method for the Home Health Care Problem

摘要: We propose a heuristic adaptation of logic-based Benders decomposition to the home health care problem. The objective is design routes and schedules for workers who visit patient homes, so as minimize cost while meeting all needs work requirements. solve master problem by greedy that enhanced propagation facilities constraint programming (CP). subproblems entirely CP generate cuts exploit structure. Many subproblem constraints are included in compensate difficulty designing strong cuts, but they serve guidance rather than be satisfied. also experiment with local search hasten discovery feasible solution. report preliminary computational results realistic instances.