A matheuristic approach for solving a home health care problem

We deal with a Home Health Care Problem (HHCP) which objective consists in constructing the optimal routes and rosters for the health care staffs. The challenge lies in combining aspects of vehicle routing and staff rostering which are two well known hard combinatorial optimization problems. To solv...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 41; pp. 471 - 478
Main Authors Allaoua, Hanane, Borne, Sylvie, Létocart, Lucas, Wolfler Calvo, Roberto
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.2013
Elsevier
Subjects
Computer Science
Discrete Mathematics
Home health care
Operations Research
rostering
vehicle routing with time windows
rostering
Home health care
vehicle routing with time windows
Online AccessGet full text
ISSN1571-0653
1571-0653
DOI10.1016/j.endm.2013.05.127

Cover

More Information
Summary:We deal with a Home Health Care Problem (HHCP) which objective consists in constructing the optimal routes and rosters for the health care staffs. The challenge lies in combining aspects of vehicle routing and staff rostering which are two well known hard combinatorial optimization problems. To solve this problem, we initially propose an integer linear programming formulation (ILP) and we tested this model on small instances. To deal with larger instances we develop a matheuristic based on the decomposition of the ILP formulation into two problems. The first one is a set partitioning like problem and it represents the rostering part. The second problem consists in the routing part. This latter is equivalent to a Multi-depot Traveling Salesman Problem with Time Windows (MTSPTW).
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2013.05.127