A Gossip Algorithm for Home Healthcare Scheduling and Routing Problems
Paper in proceedings, 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

Author

Sarmad Riazi

Chalmers, Signals and Systems, Systems and control, Automation

Payam Chehrazi

Chalmers, Signals and Systems

Oskar Wigström

Chalmers, Signals and Systems, Systems and control, Automation

Kristofer Bengtsson

Chalmers, Signals and Systems, Systems and control, Automation

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014; Cape Town; South Africa; 24 August 2014 through 29 August 2014

1474-6670 (ISSN)

Vol. 19 10754-10759

Subject Categories

Health Care Service and Management, Health Policy and Services and Health Economy

Transport Systems and Logistics

Areas of Advance

Transport

DOI

10.3182/20140824-6-ZA-1003.02624

ISBN

978-3-902823-62-5

More information

Created

10/8/2017