{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T15:40:57Z","timestamp":1759160457064,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319273990"},{"type":"electronic","value":"9783319274003"}],"license":[{"start":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T00:00:00Z","timestamp":1447804800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-27400-3_22","type":"book-chapter","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T17:08:38Z","timestamp":1448989718000},"page":"247-259","source":"Crossref","is-referenced-by-count":13,"title":["A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem"],"prefix":"10.1007","author":[{"given":"Rodrigo Lankaites","family":"Pinheiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Atkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: Computational study for workforce scheduling and routing problems. In: ICORES 2014\u2014Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, pp. 434\u2013444 (2014)","key":"22_CR1","DOI":"10.5220\/0004833904340444"},{"doi-asserted-by":"crossref","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: Workforce scheduling and routing problems: literature survey and computational study. Ann. Oper. Res. (2014)","key":"22_CR2","DOI":"10.1007\/s10479-014-1687-2"},{"doi-asserted-by":"crossref","unstructured":"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\u2013293 (2015)","key":"22_CR3","DOI":"10.5220\/0005223602830293"},{"unstructured":"Cheng, E., Rich, J.L.: A home health care routing and scheduling problem (1998)","key":"22_CR4"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.cie.2007.06.002","volume":"53","author":"C Akjiratikarl","year":"2007","unstructured":"Akjiratikarl, C., Yenradee, P., Drake, P.R.: Pso-based algorithm for home care worker scheduling in the UK. Comput. Ind. Eng. 53, 559\u2013583 (2007)","journal-title":"Comput. Ind. Eng."},{"doi-asserted-by":"crossref","unstructured":"Xu, J., Chiu, S.: Effective heuristic procedures for a field technician scheduling problem. J. Heuristics 7(5), 495\u2013509 (2001)","key":"22_CR6","DOI":"10.1023\/A:1011377929184"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"JF Cordeau","year":"2010","unstructured":"Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393\u2013409 (2010)","journal-title":"J. Sched."},{"unstructured":"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)","key":"22_CR8"},{"unstructured":"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)","key":"22_CR9"},{"doi-asserted-by":"crossref","unstructured":"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\u2013172. Springer (2004)","key":"22_CR10","DOI":"10.1007\/978-1-4757-4137-7_7"},{"unstructured":"Constantino, A.A., Tozzo, E., Pinheiro, R.L., Landa-Silva, D., Rom\u00e3o, 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)","key":"22_CR11"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"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\u2013661 (2009)","journal-title":"Future Gen. Comput. Syst."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Comput. 15, 347\u2013368 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"22_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"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\u2013627 (2004)","journal-title":"J. Heuristics"},{"unstructured":"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\u2013302. Son, Norway, August 2012","key":"22_CR15"},{"issue":"3","key":"22_CR16","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","volume":"219","author":"Matias Sevel Rasmussen","year":"2012","unstructured":"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\u2013610 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"22_CR17","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Nature and Biologically Inspired Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27400-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T16:40:25Z","timestamp":1748709625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27400-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,18]]},"ISBN":["9783319273990","9783319274003"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27400-3_22","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,11,18]]}}}