A Gossip Algorithm for Home Healthcare Scheduling and Routing Problems
Paper i proceeding, 2014

Many people in need of care still live in their homes, requiring the caretakers to travel to them. Assigning tasks to nurses (or caretakers) and scheduling their work plans is an NP-hard problem, which can be expressed as a vehicle routing problem with time windows (VRPTW) that includes additional problem-specific constraints. In this paper, we propose to solve the Home Healthcare Scheduling and Routing Problem (HHCRSP) by a distributed Gossip algorithm. We also apply an extended version called n-Gossip, which provides the required flexibility to balance optimality versus computational speed. We also introduce a relaxation on the optimality of the underlying solver in the Gossip, which speeds up the iterations of the Gossip algorithm, and helps to quickly obtain solutions with good quality.

Gossip Algorithm

Vehicle Routing Problem with Time Windows

Home Healthcare

Författare

Sarmad Riazi

Chalmers, Signaler och system, System- och reglerteknik

Payam Chehrazi

Chalmers, Signaler och system

Oskar Wigström

Chalmers, Signaler och system, System- och reglerteknik

Kristofer Bengtsson

Chalmers, Signaler och system, System- och reglerteknik

Bengt Lennartson

Chalmers, Signaler och system, System- och reglerteknik

IFAC Proceedings Volumes (IFAC-PapersOnline)

14746670 (ISSN)

Vol. 19 10754-10759
978-3-902823-62-5 (ISBN)

Ämneskategorier

Hälso- och sjukvårdsorganisation, hälsopolitik och hälsoekonomi

Transportteknik och logistik

Styrkeområden

Transport

DOI

10.3182/20140824-6-ZA-1003.02624

ISBN

978-3-902823-62-5

Mer information

Senast uppdaterat

2023-08-08