A biased-randomized heuristic for the home healthcare routing problem

Manuel Eliseu, M. Isabel Gomes, Angel A. Juan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Downloads (Pure)

Abstract

The home healthcare routing problem (HHRP) refers to the problem of allocating and routing caregivers to care-dependent people at their homes. It has been mostly tackled in the literature as a rich vehicle routing problem with time windows. This paper proposes a biased-randomized heuristic, based on the well-known savings heuristic, to solve the HHRP. The algorithm is tested in small but real-case instances where patients’ visits may occur more than once a day and, in such cases, all the visits have to be performed by the same caregiver. The results show the algorithm provides good quality results in reasonably low computing times.

Original languageEnglish
Title of host publicationOperational Research - IO2017
PublisherSpringer New York LLC
Pages57-67
Number of pages11
Volume223
ISBN (Electronic)978-3-319-71583-4
ISBN (Print)978-3-319-71582-7
DOIs
Publication statusPublished - 1 Jan 2018
Event18th Congress of APDIO, the Portuguese Association of Operational Research, 2017 - Valenca, Portugal
Duration: 28 Jun 201730 Jun 2017

Conference

Conference18th Congress of APDIO, the Portuguese Association of Operational Research, 2017
CountryPortugal
CityValenca
Period28/06/1730/06/17

Keywords

  • Biased-randomized heuristic
  • Home healthcare
  • Real case instances
  • Vehicle routing problem with time windows

Fingerprint Dive into the research topics of 'A biased-randomized heuristic for the home healthcare routing problem'. Together they form a unique fingerprint.

Cite this