A biased-randomized heuristic for the home healthcare routing problem

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

doi:10.1007/978-3-319-71583-4_5

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 proceeding › Conference contribution › peer-review

1 Citation (Scopus)

44 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 language	English
Title of host publication	Operational Research - IO2017
Publisher	Springer New York LLC
Pages	57-67
Number of pages	11
Volume	223
ISBN (Electronic)	978-3-319-71583-4
ISBN (Print)	978-3-319-71582-7
DOIs	https://doi.org/10.1007/978-3-319-71583-4_5
Publication status	Published - 1 Jan 2018
Event	18th Congress of APDIO, the Portuguese Association of Operational Research, 2017 - Valenca, Portugal Duration: 28 Jun 2017 → 30 Jun 2017

Conference

Conference	18th Congress of APDIO, the Portuguese Association of Operational Research, 2017
Country/Territory	Portugal
City	Valenca
Period	28/06/17 → 30/06/17

Keywords

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

Access to Document

10.1007/978-3-319-71583-4_5

2018_EliseuGomes Juan_IO2018 Accepted author manuscript, 426 KB

Cite this

@inproceedings{59ea38109280440babe6db083e0f62e4,

title = "A biased-randomized heuristic for the home healthcare routing problem",

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{\textquoteright} 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.",

keywords = "Biased-randomized heuristic, Home healthcare, Real case instances, Vehicle routing problem with time windows",

author = "Manuel Eliseu and Gomes, {M. Isabel} and Juan, {Angel A.}",

note = "info:eu-repo/grantAgreement/FCT/5876/147204/PT# ; 18th Congress of APDIO, the Portuguese Association of Operational Research, 2017 ; Conference date: 28-06-2017 Through 30-06-2017",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-71583-4_5",

language = "English",

isbn = "978-3-319-71582-7",

volume = "223",

pages = "57--67",

booktitle = "Operational Research - IO2017",

publisher = "Springer New York LLC",

}

TY - GEN

T1 - A biased-randomized heuristic for the home healthcare routing problem

AU - Eliseu, Manuel

AU - Gomes, M. Isabel

AU - Juan, Angel A.

N1 - info:eu-repo/grantAgreement/FCT/5876/147204/PT#

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Biased-randomized heuristic

KW - Home healthcare

KW - Real case instances

KW - Vehicle routing problem with time windows

UR - http://www.scopus.com/inward/record.url?scp=85042539203&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-71583-4_5

DO - 10.1007/978-3-319-71583-4_5

M3 - Conference contribution

AN - SCOPUS:85042539203

SN - 978-3-319-71582-7

VL - 223

SP - 57

EP - 67

BT - Operational Research - IO2017

PB - Springer New York LLC

T2 - 18th Congress of APDIO, the Portuguese Association of Operational Research, 2017

Y2 - 28 June 2017 through 30 June 2017

ER -

A biased-randomized heuristic for the home healthcare routing problem

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this