Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem

Wasakorn Laesanklang, Dario Landa-Silva, J. Arturo Castillo Salazar

2015

Abstract

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.

Paper Citation

in Harvard Style

Laesanklang W., Landa-Silva D. and Arturo Castillo Salazar J. (2015). Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 283-293. DOI: 10.5220/0005223602830293

in Bibtex Style

@conference{icores15,
author={Wasakorn Laesanklang and Dario Landa-Silva and J. Arturo Castillo Salazar},
title={Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={283-293},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005223602830293},
isbn={978-989-758-075-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem
SN - 978-989-758-075-8
AU - Laesanklang W.
AU - Landa-Silva D.
AU - Arturo Castillo Salazar J.
PY - 2015
SP - 283
EP - 293
DO - 10.5220/0005223602830293