The Electric Home Health Care Routing and Scheduling Problem With Time Windows and Fast Chargers

Abstract

This paper introduces the electric home health care routing and scheduling problem with time windows and fast chargers. The problem aims to construct the daily routes of health care nurses so as to provide a series of services to the patients located at a scattered area. The problem minimizes the total cost, which comprises of total traveling cost of electric vehicles, total cost of uncovered jobs, and total costs of recharged energy. We develop an adaptive large neighborhood search heuristic, which contains a number of advanced efficient procedures tailored to handle specific features of the problem. The paper conducts extensive computational experiments on generated benchmark instances and assesses the competitiveness of the heuristic. Results show that the heuristic is highly effective on the problem. Our analyses quantify the advantages of considering all charger technologies, i.e., normal, fast-and super-fast. We show that the downgrading of competence levels of jobs yields an improvement in total cost.