General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits

Home healthcare centers are facing increasing demands and researchers are attracted by the related routing and scheduling issue that is presented in literature as a VRP with synchronization and time windows constraints. The goal is to optimize the assignment of visits to home caregivers and the sequ...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 58; pp. 63 - 70
Main Authors Frifita, Sana, Masmoudi, Malek, Euchi, Jalel
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2017
Subjects
G-VNS
Home healthcare
routing and scheduling
VRPTWSyn
VRPTWSyn
G-VNS
routing and scheduling
Home healthcare
Online AccessGet full text
ISSN1571-0653
1571-0653
DOI10.1016/j.endm.2017.03.009

Cover

More Information
Summary:Home healthcare centers are facing increasing demands and researchers are attracted by the related routing and scheduling issue that is presented in literature as a VRP with synchronization and time windows constraints. The goal is to optimize the assignment of visits to home caregivers and the sequence of visits execution. In this paper, a General Variable Neighborhood Search is provided. Experiments conducted on benchmark instances from the literature clearly show that our method is fast and outperforms the existing approaches on half of the instances.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2017.03.009