Dataset of Home Care Scheduling and Routing Problems with Synchronized Visits



Instances of the Home Care Scheduling and Routing Problem with Synchronized Visits obtained from a private home care provider which operates in a major city in the UK.

The dataset is released on the Open Data Commons Attribution License (ODC-BY) by Glasgow City Council.

The dataset consists of text files in the CSV format.

The carers.csv file contains a list of time slots in which a given carer works. Each row contains a time slot defined by Begin and End columns in which a carer indicated in the CarerId column is available for work on a day given in the Date column.

The visits.csv file contains a list of visits to be performed. The UserId column indicates a reference location of a visit that is used for travel time estimation. The Date column denotes the day in which a visit should be performed. The Time column defines a preferred start time for a visit. Since respecting the preferred time exactly may be difficult to accomplish a time window in which a visit can be started is defined. The preferred start time for a visit is in the middle of the time window. The Duration column contains the estimated length of a visit in seconds. The CarerCount column indicates the number of carers required to perform a visit.

The distances.csv file contains time required for travel between any two possible visits locations. The file contains a square symmetric matrix in which each element indicates travel time in seconds between two possible visit locations. The header as well as the first column of the file refer to the UserID index which links visits and locations.
Date made available25 Oct 2018
PublisherUniversity of Strathclyde
Temporal coverage1 Oct 2017 - 14 Oct 2017
Date of data production10 Oct 2017

Cite this