Next Article in Journal
γ-Graphs of Trees
Next Article in Special Issue
A Novel Virtual Sample Generation Method to Overcome the Small Sample Size Problem in Computer Aided Medical Diagnosing
Previous Article in Journal
Soft Iterative Decoding Algorithms for Rateless Codes in Satellite Systems
Previous Article in Special Issue
Deep Learning with a Recurrent Network Structure in the Sequence Modeling of Imbalanced Data for ECG-Rhythm Classifier
Open AccessFeature PaperArticle

Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services

1
Natan, 44 Rue Notre Dame Des Victoires, 75002 Paris, France
2
ICD-LOSI, University of Technology of Troyes, 12 Rue Marie Curie, CEDEX CS 42060-10004 Troyes, France
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(8), 152; https://doi.org/10.3390/a12080152
Received: 28 June 2019 / Revised: 22 July 2019 / Accepted: 23 July 2019 / Published: 30 July 2019
(This article belongs to the Special Issue Evolutionary Algorithms in Health Technologies)
  |  
PDF [1057 KB, uploaded 31 July 2019]
  |  

Abstract

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. View Full-Text
Keywords: multi-objective optimization; vehicle routing problem; home healthcare; synchronization constraints; precedence constraints; preferences multi-objective optimization; vehicle routing problem; home healthcare; synchronization constraints; precedence constraints; preferences
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Ait Haddadene, S.R.; Labadie, N.; Prodhon, C. Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services. Algorithms 2019, 12, 152.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top