Abstract
This study focuses on the home health care routing problem (HHCRP) in the scenario of high population density areas where many elders live closely together. This study considers two main objectives. The first is to reduce travel and wait times for nurses or elders. The second concerns socially related objectives in scheduling problems, such as ‘quality of life’ and empowerment, by considering assumptions related to the acquaintanceship and mutual preferences of nurses and elders. This study models the effects of mutual preferences and acquaintanceship on service time in HHCRP. We use the Markov decision process and chance-constrained programming (CCP) to model the system to conserve the sequential service provision parameters and better represent the influence of stochastic service times. Because traditional deterministic algorithms cannot solve such a model, we apply a model-free reinforcement learning algorithm, Q-learning (QL), as well as the ant colony optimisation (ACO) algorithm. Thus, we tackle this problem by developing a model and algorithm to solve complex, large-scale systems. This study’s theoretical and practical contributions are verified by feedback from researchers and practitioners.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
