The Home Care Crew Scheduling Problem

Matias Sevel Rasmussen, Tor Justesen

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    Abstract

    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.
    Original languageEnglish
    Publication date2009
    Publication statusPublished - 2009
    Event3rd Nordic Optimization Symposium - Royal Institute of Technology (KTH), Stockholm, Sweden
    Duration: 13 Mar 200914 Mar 2009
    Conference number: 3
    http://www.math.kth.se/optsyst/3nos/

    Conference

    Conference3rd Nordic Optimization Symposium
    Number3
    LocationRoyal Institute of Technology (KTH)
    CountrySweden
    CityStockholm
    Period13/03/200914/03/2009
    Internet address

    Cite this

    Rasmussen, M. S., & Justesen, T. (2009). The Home Care Crew Scheduling Problem. Abstract from 3rd Nordic Optimization Symposium, Stockholm, Sweden.
    Rasmussen, Matias Sevel ; Justesen, Tor. / The Home Care Crew Scheduling Problem. Abstract from 3rd Nordic Optimization Symposium, Stockholm, Sweden.
    @conference{d286eebc345f4a89b5e625fdf7ed63ad,
    title = "The Home Care Crew Scheduling Problem",
    abstract = "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.",
    author = "Rasmussen, {Matias Sevel} and Tor Justesen",
    year = "2009",
    language = "English",
    note = "3rd Nordic Optimization Symposium, NOS ; Conference date: 13-03-2009 Through 14-03-2009",
    url = "http://www.math.kth.se/optsyst/3nos/",

    }

    Rasmussen, MS & Justesen, T 2009, 'The Home Care Crew Scheduling Problem' 3rd Nordic Optimization Symposium, Stockholm, Sweden, 13/03/2009 - 14/03/2009, .

    The Home Care Crew Scheduling Problem. / Rasmussen, Matias Sevel; Justesen, Tor.

    2009. Abstract from 3rd Nordic Optimization Symposium, Stockholm, Sweden.

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    TY - ABST

    T1 - The Home Care Crew Scheduling Problem

    AU - Rasmussen, Matias Sevel

    AU - Justesen, Tor

    PY - 2009

    Y1 - 2009

    N2 - 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.

    AB - 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.

    M3 - Conference abstract for conference

    ER -

    Rasmussen MS, Justesen T. The Home Care Crew Scheduling Problem. 2009. Abstract from 3rd Nordic Optimization Symposium, Stockholm, Sweden.