A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem

  • Rodrigo Lankaites Pinheiro
  • Dario Landa-Silva
  • Jason Atkin
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 419)

Abstract

The workforce scheduling and routing problem (WSRP) is a combinatorial optimisation problem where a set of workers must perform visits to geographically scattered locations. We present a Variable Neighbourhood Search (VNS) metaheuristic algorithm to tackle this problem, incorporating two novel heuristics tailored to the problem-domain. The first heuristic restricts the search space using a priority list of candidate workers and the second heuristic seeks to reduce the violation of specific soft constraints. We also present two greedy constructive heuristics to give the VNS a good starting point. We show that the use of domain-knowledge in the design of the algorithm can provide substantial improvements in the quality of solutions. The proposed VNS provides the first benchmark results for the set of real-world WSRP scenarios considered.

Keywords

Workforce scheduling and routing problems Home healthcare scheduling Variable neighbourhood search constructive heuristics 

References

  1. 1.
    Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: Computational study for workforce scheduling and routing problems. In: ICORES 2014—Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, pp. 434–444 (2014)Google Scholar
  2. 2.
    Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: Workforce scheduling and routing problems: literature survey and computational study. Ann. Oper. Res. (2014)Google Scholar
  3. 3.
    Laesanklang, W., Landa-Silva, D., Salazar, J.A.C.: 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, pp. 283–293 (2015)Google Scholar
  4. 4.
    Cheng, E., Rich, J.L.: A home health care routing and scheduling problem (1998)Google Scholar
  5. 5.
    Akjiratikarl, C., Yenradee, P., Drake, P.R.: Pso-based algorithm for home care worker scheduling in the UK. Comput. Ind. Eng. 53, 559–583 (2007)CrossRefGoogle Scholar
  6. 6.
    Xu, J., Chiu, S.: Effective heuristic procedures for a field technician scheduling problem. J. Heuristics 7(5), 495–509 (2001)Google Scholar
  7. 7.
    Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393–409 (2010)CrossRefMathSciNetMATHGoogle Scholar
  8. 8.
    Misir, M., Smet, P., Verbeeck, K., Vanden Berghe, G.: Security personnel routing and rostering: a hyper-heuristic approach. In: Proceedings of the 3rd International Conference on Applied Operational Research, vol. 3 (2011)Google Scholar
  9. 9.
    Algethami, H., Landa-Silva, D.: A study of genetic operators for the workforce scheduling and routing problem. In: Proceedings of the XI Metaheuristics International Conference (MIC 2015) (2015)Google Scholar
  10. 10.
    Burke, E., De Causmaecker, P., Petrovic, S., Berghe, G.: Variable neighborhood search for nurse rostering problems. In: Metaheuristics: Computer Decision-Making. Applied Optimization. vol. 86, pp. 153–172. Springer (2004)Google Scholar
  11. 11.
    Constantino, A.A., Tozzo, E., Pinheiro, R.L., Landa-Silva, D., Romão, W.: A variable neighbourhood search for nurse scheduling with balanced preference satisfaction. In: 17th International Conference on Enterprise Information Systems (ICEIS 2015), Barcelona, Spain, Scitepress, Scitepress (2015)Google Scholar
  12. 12.
    Roshanaei, V., Naderi, B., Jolai, F., Khalili, M.: A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Gen. Comput. Syst. 25(6), 654–661 (2009)CrossRefGoogle Scholar
  13. 13.
    Bräysy, O.: A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Comput. 15, 347–368 (2003)CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613–627 (2004)CrossRefGoogle Scholar
  15. 15.
    Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: 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), pp. 283–302. Son, Norway, August 2012Google Scholar
  16. 16.
    Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219(3), 598–610 (2012)Google Scholar
  17. 17.
    Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Rodrigo Lankaites Pinheiro
    • 1
  • Dario Landa-Silva
    • 1
  • Jason Atkin
    • 1
  1. 1.School of Computer Science, ASAP Research GroupThe University of NottinghamNottinghamUK

Personalised recommendations