Decomposition techniques with mixed integer programming and heuristics for home healthcare planning

Laesanklang, Wasakorn and Landa-Silva, Dario (2016) Decomposition techniques with mixed integer programming and heuristics for home healthcare planning. Annals of Operations Research . ISSN 1572-9338

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (2MB) | Preview

Abstract

We tackle home healthcare planning scenarios in the UK using decomposition methods that incorporate mixed integer programming solvers and heuristics. Home healthcare planning is a difficult problem that integrates aspects from scheduling and routing. Solving real-world size instances of these problems still presents a significant challenge to modern exact optimization solvers. Nevertheless, we propose decomposition techniques to harness the power of such solvers while still offering a practical approach to produce high-quality solutions to real-world problem instances. We first decompose the problem into several smaller sub-problems. Next, mixed integer programming and/or heuristics are used to tackle the sub-problems. Finally, the sub-problem solutions are combined into a single valid solution for the whole problem. The different decomposition methods differ in the way in which subproblems are generated and the way in which conflicting assignments are tackled (i.e. avoided or repaired). We present the results obtained by the proposed decomposition methods and compare them to solutions obtained with other methods. In addition, we conduct a study that reveals how the different steps in the proposed method contribute to those results. The main contribution of this paper is a better understanding of effective ways to combine mixed integer programming within effective decomposition methods to solve real-world instances of home healthcare planning problems in practical computation time.

Item Type: Article
Keywords: Home healthcare planning; workforce scheduling and routing; mixed integer programming; problem decomposition; heuristic decomposition
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1007/s10479-016-2352-8
Depositing User: Landa-Silva, Dario
Date Deposited: 27 Oct 2016 12:27
Last Modified: 27 Oct 2016 12:35
URI: http://eprints.nottingham.ac.uk/id/eprint/37904

Actions (Archive Staff Only)

Edit View Edit View