CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Gossip Algorithm for Home Healthcare Scheduling and Routing Problems

Sarmad Riazi (Institutionen för signaler och system, Automation) ; Payam Chehrazi (Institutionen för signaler och system) ; Oskar Wigström (Institutionen för signaler och system, Automation) ; Kristofer Bengtsson (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, 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). Vol. 19 (2014), p. 10754-10759.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Home Healthcare, Vehicle Routing Problem with Time Windows, Gossip Algorithm



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2015-01-16. Senast ändrad 2016-09-14.
CPL Pubid: 210941

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)