New decomposition methods for home care scheduling with predefined visits
Computers & Operations Research(2020)
摘要
•We consider the home health care scheduling problem with predefined visits, patient-to-provider assignment and synchronization constraints.•We propose a new subproblem resolution for an existing Logic Based Benders Decomposition.•We present a new Logic Based Benders Decomposition based on the patients’ visit patterns.•We introduce a new matheuristic method using a large neighborhood search with a set partitioning resolution.•We solve all the literature benchmark instances in less than 20 s.
更多查看译文
关键词
Home care,Scheduling,LBBD,Matheuristic,LNS
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络