TY - GEN
T1 - Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
AU - Laesanklang, Wasakorn
AU - Landa-Silva, Dario
AU - Castillo-Salazar, J. Arturo
N1 - Publisher Copyright:
Copyright © 2015 SCITEPRESS - Science and Technology Publications All rights reserve.
PY - 2015
Y1 - 2015
N2 - We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. This problem arises from a number of home care planning scenarios in the UK, faced by our industrial partner. We present a mixed integer programming model that incorporates important real-world features of the problem such as defined geographical regions and flexibility in the workers' availability. Given the size of the real-world instances, we propose to decompose the problem based on geographical areas. We show that the quality of the overall solution is affected by the ordering in which the sub-problems are tackled. Hence, we investigate different ordering strategies to solve the sub-problems and show that such decomposition approach is a very promising technique to produce high-quality solutions in practical computational times using an exact optimization method.
AB - We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. This problem arises from a number of home care planning scenarios in the UK, faced by our industrial partner. We present a mixed integer programming model that incorporates important real-world features of the problem such as defined geographical regions and flexibility in the workers' availability. Given the size of the real-world instances, we propose to decompose the problem based on geographical areas. We show that the quality of the overall solution is affected by the ordering in which the sub-problems are tackled. Hence, we investigate different ordering strategies to solve the sub-problems and show that such decomposition approach is a very promising technique to produce high-quality solutions in practical computational times using an exact optimization method.
KW - Home care scheduling
KW - Mixed integer programming
KW - Problem decomposition
KW - Routing problem
KW - Workforce scheduling
UR - http://www.scopus.com/inward/record.url?scp=84945895538&partnerID=8YFLogxK
U2 - 10.5220/0005223602830293
DO - 10.5220/0005223602830293
M3 - Conference contribution
AN - SCOPUS:84945895538
T3 - ICORES 2015 - 4th International Conference on Operations Research and Enterprise Systems, Proceedings
SP - 283
EP - 293
BT - ICORES 2015 - 4th International Conference on Operations Research and Enterprise Systems, Proceedings
A2 - Vitoriano, Begona
A2 - Parlier, Greg H.
PB - SciTePress
T2 - 4th International Conference on Operations Research and Enterprise Systems, ICORES 2015
Y2 - 10 January 2015 through 12 January 2015
ER -