{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:33:28Z","timestamp":1782837208766,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T00:00:00Z","timestamp":1500336000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000739","name":"University of Southampton","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000739","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10732-017-9347-8","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T06:43:54Z","timestamp":1500360234000},"page":"471-500","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Iterated local search for workforce scheduling and routing problems"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4547-4376","authenticated-orcid":false,"given":"Fulin","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tolga","family":"Bekta\u015f","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,18]]},"reference":[{"issue":"4","key":"9347_CR1","doi-asserted-by":"crossref","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(4), 559\u2013583 (2007)","journal-title":"Comput. Ind. Eng."},{"issue":"10","key":"9347_CR2","doi-asserted-by":"crossref","first-page":"2866","DOI":"10.1016\/j.cor.2005.01.015","volume":"33","author":"S Bertels","year":"2006","unstructured":"Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33(10), 2866\u20132890 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9347_CR3","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.cor.2015.07.001","volume":"65","author":"S Binart","year":"2016","unstructured":"Binart, S., Dejax, P., Gendreau, M., Semet, F.: A 2-stage method for a field service routing problem with stochastic travel and service times. Comput. Oper. Res. 65, 64\u201375 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"9347_CR4","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1057\/palgrave.jors.2601625","volume":"54","author":"M Blais","year":"2003","unstructured":"Blais, M., Lapierre, S.D., Laporte, G.: Solving a home-care districting problem in an urban setting. J. Oper. Res. Soc. 54(11), 1141\u20131147 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"9347_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., V\u00e1zquez-Rodr\u00edguez, J.A., Gendreau, M.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: IEEE Congress on Evolutionary Computation, Barcelona, Spain, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586064"},{"key":"9347_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-642-21527-8_40","volume-title":"Network Optimization","author":"P Cappanera","year":"2011","unstructured":"Cappanera, P., Gouveia, L., Scutell\u00e0, M.G.: The skill vehicle routing problem. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) Network Optimization. Lecture Notes in Computer Science, vol. 6701, pp. 354\u2013364. Springer, Berlin, Heidelberg (2011)"},{"key":"9347_CR7","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, Son, Norway, pp. 283\u2013302 (2012)"},{"key":"9347_CR8","doi-asserted-by":"crossref","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: 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, Lisbon, Portugal, pp. 367\u2013375 (2015)","DOI":"10.5220\/0005223203670375"},{"issue":"2","key":"9347_CR9","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1016\/j.eswa.2009.06.047","volume":"37","author":"P Chen","year":"2010","unstructured":"Chen, P., Huang, H.K., Dong, X.Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst. Appl. 37(2), 1620\u20131627 (2010)","journal-title":"Expert Syst. Appl."},{"key":"9347_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.omega.2015.07.006","volume":"61","author":"X Chen","year":"2015","unstructured":"Chen, X., Thomas, B.W., Hewitt, M.: The technician routing problem with experience-based service times. Omega 61, 49\u201361 (2015)","journal-title":"Omega"},{"key":"9347_CR11","unstructured":"Chiarandini, M., St\u00fctzle, T.: An application of iterated local search to graph coloring problem. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY, pp. 112\u2013125 (2002)"},{"issue":"3","key":"9347_CR12","first-page":"292","volume":"39","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. Inf. Syst. Oper. Res. 39(3), 292\u2013298 (2001)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"2","key":"9347_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"8","key":"9347_CR14","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928\u2013936 (2001)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"9347_CR15","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"JF Cordeau","year":"2004","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Soc. 55(5), 542\u2013546 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9347_CR16","doi-asserted-by":"crossref","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."},{"issue":"6","key":"9347_CR17","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"4","key":"9347_CR18","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn, A., Kolind, E., Clausen, J.: The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput. Oper. Res. 36(4), 1145\u20131157 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9347_CR19","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical report CS-89-85, Electrical Engineering and Computer Science Department, University of Tennessee (2014)"},{"issue":"1","key":"9347_CR20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","volume":"183","author":"F Glover","year":"2011","unstructured":"Glover, F., Hao, J.K.: The case for strategic oscillation. Ann. Oper. Res. 183(1), 163\u2013173 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9347_CR21","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.disopt.2007.05.004","volume":"5","author":"H Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim. 5(2), 434\u2013456 (2008)","journal-title":"Discrete Optim."},{"issue":"11","key":"9347_CR22","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1016\/j.dam.2007.04.022","volume":"156","author":"T Ibaraki","year":"2008","unstructured":"Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T., Yagiura, M.: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl. Math. 156(11), 2050\u20132069 (2008)","journal-title":"Discrete Appl. Math."},{"key":"9347_CR23","first-page":"337","volume-title":"Local Search in Combinatorial Optimization","author":"GAP Kindervater","year":"1997","unstructured":"Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Aarts, E.H., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 337\u2013360. Wiley, Chichester (1997)"},{"issue":"5","key":"9347_CR24","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579\u2013600 (2012)","journal-title":"J. Sched."},{"key":"9347_CR25","first-page":"320","volume-title":"Handbook of Metaheuristics, International Series in Operations Research & Management Science","author":"H Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, pp. 320\u2013353. Springer, Boston (2003)"},{"issue":"2","key":"9347_CR26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","volume":"83","author":"HR Louren\u00e7o","year":"1995","unstructured":"Louren\u00e7o, H.R.: Job-shop scheduling: computational study of local search and large-step optimization methods. Eur. J. Oper. Res. 83(2), 347\u2013364 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9347_CR27","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","volume":"41","author":"J Michallet","year":"2014","unstructured":"Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., Vitry, G.: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput. Oper. Res. 41, 196\u2013207 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9347_CR28","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Br\u00e4ysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4), 724\u2013737 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9347_CR29","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heuristics 19(2), 201\u2013232 (2013)","journal-title":"J. Heuristics"},{"key":"9347_CR30","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.L.: On the dynamic technician routing and scheduling problem. In: Proceedings of the 5th International Workshop on Freight Transportation and Logistics (ODYSSEUS 2012), Mykonos, Greece (2012)"},{"issue":"7","key":"9347_CR31","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","volume":"7","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.L.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. 7(7), 1525\u20131535 (2013)","journal-title":"Optim. Lett."},{"issue":"8","key":"9347_CR32","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1007\/s11590-012-0524-2","volume":"7","author":"S Schwarze","year":"2012","unstructured":"Schwarze, S., Vo\u00df, S.: Improved load balancing and resource utilization for the skill vehicle routing problem. Optim. Lett. 7(8), 1805\u20131823 (2012)","journal-title":"Optim. Lett."},{"issue":"2","key":"9347_CR33","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"3","key":"9347_CR34","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"9347_CR35","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9347_CR36","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10732-014-9273-y","volume":"21","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Time-window relaxations in vehicle routing heuristics. J. Heuristics 21(3), 329\u2013358 (2015)","journal-title":"J. Heuristics"},{"key":"9347_CR37","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-642-34413-8_19","volume-title":"Learning and Intelligent Optimization","author":"JD Walker","year":"2012","unstructured":"Walker, J.D., Ochoa, G., Gendreau, M., Burke, E.K.: Vehicle routing and adaptive iterated local search within the hyflex hyper-heuristic framework. In: Hamadi, Y., Schoenauer, M. (eds.) Learning and Intelligent Optimization, pp. 265\u2013276. Springer, Berlin, Heidelberg (2012)"},{"issue":"7","key":"9347_CR38","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1057\/palgrave.jors.2600746","volume":"50","author":"A Weintraub","year":"1999","unstructured":"Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., Ramirez, E.: An emergency vehicle dispatching system for an electric utility in Chile. J. Oper. Res. Soc. 50(7), 690\u2013696 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"9347_CR39","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J Xu","year":"2001","unstructured":"Xu, J., Chiu, S.Y.: Effective heuristic procedures for a field technician scheduling problem. J. Heuristics 7(5), 495\u2013509 (2001)","journal-title":"J. Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9347-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9347-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9347-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,29]],"date-time":"2017-10-29T02:31:41Z","timestamp":1509244301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9347-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,18]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9347-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,18]]}}}