In the Home Care Crew Scheduling Problem (HCCSP) a staff of caretakers has to be assigned a number of visits, such that the total number of assigned visits is maximised. The visits have different locations and positions in time, and travelling time and time windows must be respected. The challenge when assigning visits to caretakers lies in the existence of soft constraints and indeed also in temporal dependencies between the starting times of visits. Most former approaches to solving the HCCSP involve the use of heuristic methods. Here we develop an exact branch-and-price algorithm that uses clustering of the visits based on the problem structure. The algorithm is tested on real-life problem instances and we obtain solutions that are better than current practice in all cases.
|Publication status||Published - 2009|
|Event||3rd Nordic Optimization Symposium - Royal Institute of Technology (KTH), Stockholm, Sweden|
Duration: 13 Mar 2009 → 14 Mar 2009
Conference number: 3
|Conference||3rd Nordic Optimization Symposium|
|Location||Royal Institute of Technology (KTH)|
|Period||13/03/2009 → 14/03/2009|