A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints

J. Arturo Castillo-Salazar, Dario Landa-Silva, Rong Qu

Abstract

We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These types of constraints are important because they allow the modelling of situations in which activities relate to each other time-wise, e.g. synchronising two technicians to complete a job. These constraints often make the scheduling and routing of employees more difficult. GHI is tested on set of benchmark instances from different workforce scheduling and routing problems (WSRPs). We compare the results obtained by GHI against the results from a mathematical programming solver. The comparison seeks to determine which solution method achieves more best solutions across all instances. Two parameters of GHI are discussed, the sorting of employees and the sorting of visits. We conclude that using the solver is adequate for instances with less than 100 visits but for larger instances GHI obtains better results in less 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, doi:10.1016/j.cie.2007.06.002.
  2. Castillo-Salazar, J. A., Landa-Silva, D., and Qu, R. (2012). A survey on workforce scheduling and routing problems. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pages 283-302, Son, Norway.
  3. 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.
  4. Castro-Gutierrez, J., Landa-Silva, D., and Moreno-Perez, 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. Chuin Lau, H. and Gunawan, A. (2012). The patrol scheduling problem. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pages 175-192, Son, Norway.
  6. 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, doi:10.1007/s10951-010-0188-7.
  7. G√ľnther, M. and Nissen, V. (2012). Application of particle swarm optimization to the british telecom workforce scheduling problem. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pages 242- 256, Son, Norway.
  8. Kergosien, Y., Lente, C., and Billaut, J.-C. (2009). Home health care problem, an extended multiple travelling salesman problem. In Blazewicz, J., Drozdowski, M., Kendall, G., and McCollum, B., editors, Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), pages 85-92.
  9. Mankowska, D. S., Meisel, F., and Bierwirth, C. (2014). The home health care routing and scheduling problem with interdependant services. Health Care Management Science, 17:15-30, doi:10.1007/s10729-013- 9243-1.
  10. Misir, M., Smet, P., Verbeeck, K., and Vanden Bergue, G. (2011). Security personnel routing and rostering: a hyper-heuristic approach. In Proceedings of the 3rd International Conference on Applied Operational Research, ICAOR11, Istanbul, Turkey, 2011, pages 193- 206.
  11. 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, doi:10.1016/j.ejor.2011.10.048.
  12. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research, 35(2):254-265, doi:10.1287/opre.35.2.254.
  13. Xu, J. and Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Scheduling, 7:495-509.
Download


Paper Citation


in Harvard Style

Arturo Castillo-Salazar J., Landa-Silva D. and Qu R. (2015). A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 367-375. DOI: 10.5220/0005223203670375


in Bibtex Style

@conference{icores15,
author={J. Arturo Castillo-Salazar and Dario Landa-Silva and Rong Qu},
title={A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={367-375},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005223203670375},
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 - A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints
SN - 978-989-758-075-8
AU - Arturo Castillo-Salazar J.
AU - Landa-Silva D.
AU - Qu R.
PY - 2015
SP - 367
EP - 375
DO - 10.5220/0005223203670375