{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:19:58Z","timestamp":1720297198804},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1016\/j.cor.2022.105829","type":"journal-article","created":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T01:13:15Z","timestamp":1649553195000},"page":"105829","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search"],"prefix":"10.1016","volume":"144","author":[{"given":"Hanyu","family":"Gu","sequence":"first","affiliation":[]},{"given":"Yefei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2022.105829_b1","series-title":"2017 IEEE Congress on Evolutionary Computation","first-page":"1771","article-title":"Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem","author":"Algethami","year":"2017"},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b2","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s10732-018-9385-x","article-title":"Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem","volume":"25","author":"Algethami","year":"2019","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2022.105829_b3","series-title":"2016 IEEE Congress on Evolutionary Computation","first-page":"927","article-title":"A genetic algorithm for a workforce scheduling and routing problem","author":"Algethami","year":"2016"},{"key":"10.1016\/j.cor.2022.105829_b4","series-title":"Europe\u2019s demographic future: facts and figures on challenges and opportunities","author":"Anon","year":"2007"},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10951-009-0152-6","article-title":"On the partitioning of dynamic workforce scheduling problems","volume":"13","author":"Borenstein","year":"2010","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b6","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ejor.2015.07.028","article-title":"A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience","volume":"248","author":"Braekers","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b7","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle routing problem with time windows, part I: Route construction and local search algorithms","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","article-title":"Workforce scheduling and routing problems: literature survey and computational study","volume":"239","author":"Castillo-Salazar","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b9","series-title":"27th International Conference on Automated Planning and Scheduling, Vol. 27","first-page":"358","article-title":"Tackling large-scale home health care delivery problem with uncertainty","author":"Chen","year":"2017"},{"key":"10.1016\/j.cor.2022.105829_b10","series-title":"Practical Nonparametric Statistics","author":"Conover","year":"1999"},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b11","first-page":"105","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Netw. Int. J."},{"issue":"8","key":"10.1016\/j.cor.2022.105829_b12","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","article-title":"Scheduling technicians and tasks in a telecommunications company","volume":"13","author":"Cordeau","year":"2010","journal-title":"J. Sched."},{"issue":"9","key":"10.1016\/j.cor.2022.105829_b14","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","article-title":"A parallel iterated tabu search heuristic for vehicle routing problems","volume":"39","author":"Cordeau","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b15","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b16","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","article-title":"The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach","volume":"36","author":"Dohn","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2022.105829_b17","first-page":"1734","article-title":"A Lagrangian relaxation-based algorithm to solve a home health care routing problem","volume":"31","author":"Fathollahi-Fard","year":"2018","journal-title":"Int. J. Eng."},{"key":"10.1016\/j.cor.2022.105829_b18","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.cor.2016.07.019","article-title":"Home health care routing and scheduling: A review","volume":"77","author":"Fikar","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Manage. Sci."},{"issue":"6","key":"10.1016\/j.cor.2022.105829_b20","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1287\/trsc.2019.0909","article-title":"Adaptive large neighborhood search for multitrip vehicle routing with time windows","volume":"53","author":"Fran\u00e7ois","year":"2019","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2022.105829_b21","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.cor.2022.105829_b22","series-title":"Handbook of Metaheuristics","first-page":"41","article-title":"Tabu search","author":"Gendreau","year":"2019"},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b23","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle-dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b24","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ejor.2013.05.021","article-title":"Workforce routing and scheduling for electricity network maintenance with downtime minimization","volume":"231","author":"Goel","year":"2013","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b25","series-title":"International Symposium on Experimental Algorithms","first-page":"527","article-title":"Lagrangian relaxation in iterated local search for the workforce scheduling and routing problem","author":"Gu","year":"2019"},{"key":"10.1016\/j.cor.2022.105829_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2020.102302","article-title":"The multi-period workforce scheduling and routing problem","volume":"102","author":"Guastaroba","year":"2021","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","article-title":"Lagrangean relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"TOP"},{"issue":"3","key":"10.1016\/j.cor.2022.105829_b28","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","article-title":"The electric fleet size and mix vehicle routing problem with time windows and recharging stations","volume":"252","author":"Hiermann","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2022.105829_b29","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1016\/j.dam.2007.04.022","article-title":"An iterated local search algorithm for the vehicle routing problem with convex time penalty functions","volume":"156","author":"Ibaraki","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2022.105829_b30","series-title":"Local Search in Combinatorial Optimization","first-page":"337","article-title":"Vehicle routing: handling edge exchanges","author":"Kindervater","year":"1997"},{"key":"10.1016\/j.cor.2022.105829_b31","series-title":"Nonparametric Statistical Methods Using R","author":"Kloke","year":"2015"},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","article-title":"Thirty years of heterogeneous vehicle routing","volume":"249","author":"Ko\u00e7","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2022.105829_b33","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","article-title":"Adaptive large neighborhood search for service technician routing and scheduling problems","volume":"15","author":"Kovacs","year":"2012","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b34","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.ejor.2014.12.009","article-title":"A matheuristic approach for the pollution-routing problem","volume":"243","author":"Kramer","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b35","series-title":"4th International Conference on Operations Research and Enterprise Systems","first-page":"283","article-title":"Mixed integer programming with decomposition to solve a workforce scheduling and routing problem","author":"Laesanklang","year":"2015"},{"key":"10.1016\/j.cor.2022.105829_b36","series-title":"5th International Conference on Operations Research and Enterprise Systems","first-page":"330","article-title":"Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints","author":"Laesanklang","year":"2016"},{"issue":"4\u20135","key":"10.1016\/j.cor.2022.105829_b37","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","article-title":"Classical and modern heuristics for the vehicle routing problem","volume":"7","author":"Laporte","year":"2000","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b38","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1080\/00207543.2016.1213917","article-title":"Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements","volume":"55","author":"Liu","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2022.105829_b39","series-title":"Handbook of Metaheuristics","first-page":"129","article-title":"Iterated local search: Framework and applications","author":"Louren\u00e7o","year":"2019"},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b40","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","article-title":"A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows","volume":"37","author":"Nagata","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105193","article-title":"A hybrid algorithm for time-dependent vehicle routing problem with time windows","volume":"128","author":"Pan","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2022.105829_b42","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.ejor.2017.05.035","article-title":"Resource constrained routing and scheduling: Review and research prospects","volume":"263","author":"Paraskevopoulos","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2022.105829_b43","first-page":"163","article-title":"Optimal routing and scheduling of periodic inspections in large-scale railroad networks","volume":"3","author":"Peng","year":"2013","journal-title":"J. Rail Transp. Plan. Manag."},{"key":"10.1016\/j.cor.2022.105829_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104930","article-title":"A multiperiod workforce scheduling and routing problem with dependent tasks","volume":"118","author":"Pereira","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2022.105829_b45","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","article-title":"A parallel matheuristic for the technician routing and scheduling problem","volume":"7","author":"Pillac","year":"2013","journal-title":"Optim. Lett."},{"issue":"11","key":"10.1016\/j.cor.2022.105829_b46","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1080\/01605682.2020.1792365","article-title":"A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits","volume":"72","author":"Polnik","year":"2021","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b47","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.2017.0770","article-title":"Large composite neighborhoods for the capacitated location-routing problem","volume":"53","author":"Schneider","year":"2019","journal-title":"Transp. Sci."},{"issue":"10","key":"10.1016\/j.cor.2022.105829_b48","doi-asserted-by":"crossref","first-page":"2564","DOI":"10.1016\/j.cor.2013.02.002","article-title":"A note on the time travel approach for handling time windows in vehicle routing problems","volume":"40","author":"Schneider","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105829_b49","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.eswa.2016.12.013","article-title":"A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand","volume":"72","author":"Shi","year":"2017","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2022.105829_b50","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105829_b51","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2022.105829_b52","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-017-9347-8","article-title":"Iterated local search for workforce scheduling and routing problems","volume":"23","author":"Xie","year":"2017","journal-title":"J. Heuristics"},{"issue":"5","key":"10.1016\/j.cor.2022.105829_b53","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1011377929184","article-title":"Effective heuristic procedures for a field technician scheduling problem","volume":"7","author":"Xu","year":"2001","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2022.105829_b54","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.asoc.2018.09.016","article-title":"A novel artificial bee colony algorithm for the workforce scheduling and balancing problem in sub-assembly lines with limited buffers","volume":"73","author":"Yurtkuran","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2022.105829_b55","series-title":"2020 12th International Conference on Advanced Computational Intelligence","first-page":"478","article-title":"Iterated local search with hybrid neighborhood search for workforce scheduling and routing problem","author":"Zhou","year":"2020"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054822001083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054822001083?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T02:10:36Z","timestamp":1674958236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054822001083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":55,"alternative-id":["S0305054822001083"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2022.105829","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2022,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2022.105829","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105829"}}