A Home Health Care Routing and Scheduling Problem with Synchronization, Precedence and Time Windows Constraints

• Main Authors: Yu-Hsiang Tao, 陶昱翔
• Other Authors: Yun-Zhu Lin
• Format: Others
• Language: zh-TW
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/a9r8m8

碩士 === 中原大學 === 土木工程研究所 === 106 === Home health care services are becoming important in hyper-aged society. Because of physiological disorder or diseases, seniors needs assistance with daily living activities in different degrees. Home care services are versatile. In this research, the Home Health Care Routing and Scheduling Problem （HHCRSP）considers services with synchronization, precedence and time windows constraints. It integrates the Nurse Rostering Problem （NRP）and the Vehicle Routing Problem with time windows（VRPTW）. The planning takes into account individual service requirements of the seniors, individual qualifications of the caregivers and possible interdependencies between different service operations. It also considers constraints related with workload and capacity among other limitations associated with seniors and caregivers. A mathematical model formulation will be proposed together with a powerful metaheuristic based on particle swarm optimization algorithms combined with local improvement procedures like insertion and swap. Because of the computational intractability, we attempt to develop the methodology to enable the continuous PSO algorithms to be efficiently applied to the HHCRSP. Several techniques will be developed for generating an initial solution which guides the search direction of the particle. Local improvements procedures will be embedded in the PSO algorithms to further improve the solution quality. The proposed methodologies will be implemented, tested, and compared with variety of instances which are generated by reasonable method.