摘要：AbstractWith aging populations and increasing life expectancy, Home Health Care (HHC) has become an alternative treatment modality for the elderly who want autonomy and well-being as they live longer and longer. Facing this rise in demand, the organisation and coordination of HHC institutions has become increasingly complex and difficult. This paper addresses a short-term Home Health Care Routing and Scheduling Problem (HHCRSP), formulated by Mixed Integer Linear Programming (MILP). The proposed model considers tolerance-based soft constraints in view of both patients and caregivers, with the aim of maximising the total satisfaction of all HHC stakeholders. The problem is solved by the commercial solver CPLEX. We adopt a real dataset extracted from an existing HHC institution. The numerical result on 10 generated instances shows the efficient computing performance for an optimal solution for small and medium-large sizes.
关键词：KeywordsMixed Integer Linear ProgrammingHome Health Care RoutingScheduling ProblemToleranceSoft Constraints
