Bicriteria vehicle routing problem with preferences and timing constraints in home health care services
type: Item
instance of: scholarly article
title: Bicriteria vehicle routing problem with preferences and timing constraints in home health care services
zbMATH Open document ID: 1461.90007
author: Syrine Roufaida Ait Haddadene
author: Nacima Labadie
author: Caroline Prodhon
published in: Algorithms
publication date: 2020-10-08T00:00:00Z
review text: Summary: Home Healthcare (HHC) is an emerging and fast-expanding service sector that gives rise to challenging vehicle routing and scheduling problems. Each day, HHC structures must schedule the visits of caregivers to patients requiring specific medical and paramedical services at home. These operations have the potential to be unsuitable if the visits are not planned correctly, leading hence to high logistics costs and/or deteriorated service level. In this article, this issue is modeled as a vehicle routing problem where a set of routes has to be built to visit patients asking for one or more specific service within a given time window and during a fixed service time. Each patient has a preference value associated with each available caregiver. The problem addressed in this paper considers two objectives to optimize simultaneously: minimize the caregivers' travel costs and maximize the patients' preferences. In this paper, different methods based on the bi-objective non-dominated sorting algorithm are proposed to solve the vehicle routing problem with time windows, preferences, and timing constraints. Numerical results are presented for instances with up to 73 clients. Metrics such as the distance measure, hyper-volume, and the number of non-dominated solutions in the Pareto front are used to assess the quality of the proposed approaches.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7257772
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: home healthcare
zbMATH Keywords: synchronization constraints
zbMATH Keywords: precedence constraints
zbMATH Keywords: preferences
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a12080152
OpenAlex ID: W2965222871
cites work: The truck dispatching problem
cites work: Vehicle Routing
cites work: Q4365135
cites work: Home health care routing and scheduling: a review
cites work: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
cites work: \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: A Hybrid Approach to Solve the Periodic Home Health Care Problem
cites work: A patient assignment algorithm for home care services
cites work: Securing home health care in times of natural disasters
cites work: Mid-term and short-term planning support for home health care services
cites work: A branch-and-price algorithm for the long-term home care scheduling problem
cites work: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
cites work: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
cites work: Metaheuristics for solving a multimodal home-healthcare scheduling problem
cites work: New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent
cites work: Home care service planning. The case of Landelijke Thuiszorg
cites work: A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
cites work: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
cites work: Scheduling Home Hospice Care with Logic-Based Benders Decomposition
cites work: General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
cites work: Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
cites work: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
cites work: A genetic algorithm for a bi-objective capacitated arc routing problem
cites work: Q4424332
DOI: 10.3390/A12080152
description: scientific article; zbMATH DE number 7257772