Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints

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

Abstract

We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase of problem decomposition and sub-problem solving, followed by a phase dedicated to conflict repair. Five types of time-dependent activities constraints are considered: overlapping, synchronisation, minimum difference, maximum difference, and minimum-maximum difference. Experiments are conducted to compare the proposed method to a tailored greedy heuristic. Results show that the proposed RDCR is an effective approach to harness the power of mixed integer programming solvers to tackle the difficult and highly constrained WSRP in practical computational time.

References

  1. Akjiratikarl, C., Yenradee, P., and Drake, P. R. (2007). PSO-based algorithm for home care worker scheduling in the UK. Computers & Industrial Engineering, 53(4):559-583.
  2. Castillo-Salazar, J. A., Landa-Silva, D., and Qu, R. (2014). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, doi:10.1007/s10479-014-1687-2.
  3. Castillo-Salazar, J. A., Landa-Silva, D., and Qu, R. (2015). A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints. In Proceedings of the 4th International Conference on Operations Research and Enterprise Systems (ICORES 2015).
  4. Castro-Gutierrez, J., Landa-Silva, D., and Moreno, P. J. (2011). Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on, pages 257-264.
  5. Cordeau, J.-F., Laporte, G., Pasin, F., and Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4):393- 409.
  6. Field, A. (2013). Discovering Statistics Using IBM SPSS Statistics. SAGE Publication Ltd, London, UK, 4 edition.
  7. Laesanklang, W., Landa-Silva, D., and Castillo-Salazar, J. A. (2015). Mixed integer programming with decomposition to solve a workforce scheduling and routing problem. In Proceedings of the 4th International Conference on Operations Research and Enterprise Systems (ICORES 2015), pages 283-293.
  8. Mankowska, D., Meisel, F., and Bierwirth, C. (2014). The home health care routing and scheduling problem with interdependent services. Health Care Management Science, 17(1):15-30.
  9. Misir, M., Smet, P., Verbeeck, K., and Vanden Berghe, G. (2011). Security personnel routing and rostering: a hyper-heuristic approach. In Proceedings of the 3rd International Conference on Applied Operational Research, ICAOR2011, Istanbul, Turkey, pages 193-205.
  10. Rasmussen, M. S., Justesen, T., Dohn, A., and Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3):598-610.
  11. Reimann, M., Doerner, K., and Hartl, R. F. (2004). DAnts: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research, 31(4):563 - 591.
  12. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35(2).
  13. Xu, J. and Chiu, S. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7(5):495-509.
Download


Paper Citation


in Harvard Style

Laesanklang W., Landa-Silva D. and Castillo-Salazar J. (2016). Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints . In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 330-339. DOI: 10.5220/0005757503300339


in Bibtex Style

@conference{icores16,
author={Wasakorn Laesanklang and Dario Landa-Silva and J. Arturo Castillo-Salazar},
title={Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={330-339},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005757503300339},
isbn={978-989-758-171-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints
SN - 978-989-758-171-7
AU - Laesanklang W.
AU - Landa-Silva D.
AU - Castillo-Salazar J.
PY - 2016
SP - 330
EP - 339
DO - 10.5220/0005757503300339