Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
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 p...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scipress
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31297/ |
| _version_ | 1848794170822492160 |
|---|---|
| author | Laesanklang, Wasakorn Landa-Silva, Dario Castillo-Salazar, J. Arturo |
| author_facet | Laesanklang, Wasakorn Landa-Silva, Dario Castillo-Salazar, J. Arturo |
| author_sort | Laesanklang, Wasakorn |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:11:56Z |
| format | Conference or Workshop Item |
| id | nottingham-31297 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:11:56Z |
| publishDate | 2015 |
| publisher | Scipress |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-312972020-05-04T20:11:16Z https://eprints.nottingham.ac.uk/31297/ Mixed integer programming with decomposition to solve a workforce scheduling and routing problem Laesanklang, Wasakorn Landa-Silva, Dario Castillo-Salazar, J. Arturo 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. Scipress 2015 Conference or Workshop Item PeerReviewed Laesanklang, Wasakorn, Landa-Silva, Dario and Castillo-Salazar, J. Arturo (2015) Mixed integer programming with decomposition to solve a workforce scheduling and routing problem. In: International Conference on Operations Research and Enterprise Systems (ICORES 2015), 10-12 January 2015, Lisbon, Portugal. Workforce scheduling Routing problem Home care scheduling Mixed integer programming Problem decomposition http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0005223602830293 |
| spellingShingle | Workforce scheduling Routing problem Home care scheduling Mixed integer programming Problem decomposition Laesanklang, Wasakorn Landa-Silva, Dario Castillo-Salazar, J. Arturo Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title | Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title_full | Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title_fullStr | Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title_full_unstemmed | Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title_short | Mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| title_sort | mixed integer programming with decomposition to solve a workforce scheduling and routing problem |
| topic | Workforce scheduling Routing problem Home care scheduling Mixed integer programming Problem decomposition |
| url | https://eprints.nottingham.ac.uk/31297/ https://eprints.nottingham.ac.uk/31297/ |