{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:50:12Z","timestamp":1768974612174,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2016-03896"],"award-info":[{"award-number":["RGPIN-2016-03896"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2015-04696"],"award-info":[{"award-number":["RGPIN-2015-04696"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s43069-020-00044-x","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T02:02:48Z","timestamp":1609725768000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Ines","family":"Mathlouthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0210-4033","authenticated-orcid":false,"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"issue":"5","key":"44_CR1","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283","journal-title":"Oper Res"},{"issue":"3","key":"44_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) \u201dBranch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/inte.33.1.67.12722","volume":"33","author":"F Blakeley","year":"2003","unstructured":"Blakeley F, Arguello B, Cao B, Hall W, Knolmajer J (2003) Optimizing periodic maintenance operations for Schindler elevator corporation. Interfaces 33:67\u201379","journal-title":"Interfaces"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Bostel N, Dejax P, Guez P, Tricoire F (2008) Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In: Golden B., Raghavan S., Wasil E. (eds) The vehicle routing problem: Latest advances and new challenges, volume 43 of Operations Research\/Computer Science Interfaces. Springer, pp 503\u2013525","DOI":"10.1007\/978-0-387-77778-8_23"},{"issue":"1","key":"44_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Program 20(1):255\u2013282","journal-title":"Math Program"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret Optim 12:129\u2013146","journal-title":"Discret Optim"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"J-F Cordeau","year":"2010","unstructured":"Cordeau J-F, Laporte G, Pasin F, Ropke S (2010) Scheduling technicians and tasks in a telecommunications company. J Sched 13:393\u2013409","journal-title":"J Sched"},{"issue":"4","key":"44_CR8","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transp Sci 53(4):946\u2013985","journal-title":"Transp Sci"},{"issue":"3","key":"44_CR9","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/trsc.1120.0445","volume":"47","author":"S Dabia","year":"2013","unstructured":"Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transp Sci 47(3):380\u2013396","journal-title":"Transp Sci"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cor.2016.05.003","volume":"75","author":"RB Damm","year":"2016","unstructured":"Damm RB, Resende MGC, Ronconi DP (2016) A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research 75:49\u201363","journal-title":"Computers & Operations Research"},{"issue":"3","key":"44_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessardi F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3):387\u2013404","journal-title":"Transp Sci"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44:216\u2013229","journal-title":"Networks"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02098283","volume":"61","author":"S G\u00e9linas","year":"1995","unstructured":"G\u00e9linas S, Desrochers M, Desrosiers J, Solomon MM (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann Oper Res 61:91\u2013109","journal-title":"Ann Oper Res"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","volume":"183","author":"H Hashimoto","year":"2011","unstructured":"Hashimoto H, Boussier S, Vasquez M, Wilbaut C (2011) A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann Oper Res 183:143\u2013161","journal-title":"Ann Oper Res"},{"issue":"1","key":"44_CR15","first-page":"33","volume":"56","author":"I Mathlouthi","year":"2018","unstructured":"Mathlouthi I, Gendreau M, Potvin J-Y (2018) Mixed integer linear programming for a multi-attribute technician routing and scheduling problem. Info Sys Oper Res 56(1):33\u201349","journal-title":"Info Sys Oper Res"},{"key":"44_CR16","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Technical report, PhD dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston IL"},{"issue":"3","key":"44_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin D, Contardo C, Desaulniers G, Uchoa E (2017) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J Comput 29(3):489\u2013502","journal-title":"INFORMS J Comput"},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9:61\u2013100","journal-title":"Math Program Comput"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Pillac V, Gu\u00e9ret C, Medaglia A (2018) A fast reoptimization approach for the dynamic technician routing and scheduling problem. In: Amodeo L, Talbi EG, Yalaoui F (eds) Recent developments in metaheuristics. Springer, Cham, pp 347\u2013367","DOI":"10.1007\/978-3-319-58253-5_20"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331\u2013340","journal-title":"Eur J Oper Res"},{"issue":"3","key":"44_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret Optim 3(3):255\u2013273","journal-title":"Discret Optim"},{"issue":"3","key":"44_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51 (3):155\u2013170","journal-title":"Networks"},{"key":"44_CR23","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2006.03.004","volume":"43","author":"H Tang","year":"2007","unstructured":"Tang H, Miller-Hooks E, Tomastik R (2007) Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E 43:591 \u2013 609","journal-title":"Transportation Research Part E"},{"issue":"4","key":"44_CR24","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/net.21852","volume":"73","author":"H Ben Ticha","year":"2019","unstructured":"Ben Ticha H, Absi N, Feillet D, Quilliot A, Van Woensel T (2019) A branch-and-price algorithm for the vehicle routing problem with time windows on a road network. Networks 73(4):401\u2013417","journal-title":"Networks"},{"key":"44_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang E, Voudouris C (1997) Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Oper Res Lett 20:119\u2013127","journal-title":"Oper Res Lett"},{"issue":"2","key":"44_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-009-0334-1","volume":"130","author":"F Vanderbeck","year":"2011","unstructured":"Vanderbeck F (2011) Branching in branch-and-price: a generic scheme. Math Program 130(2):249\u2013294","journal-title":"Math Program"},{"key":"44_CR27","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1287\/inte.29.1.112","volume":"29","author":"D Weigel","year":"1999","unstructured":"Weigel D, Cao B (1999) Applying GIS and OR techniques to solve Sears technician-dispatching and home delivery problems. Interfaces 29:112\u2013130","journal-title":"Interfaces"},{"key":"44_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J Xu","year":"2001","unstructured":"Xu J, Chiu SY (2001) Effective heuristic procedures for a field technician scheduling problem. J Heuristics 7:495\u2013509","journal-title":"J Heuristics"},{"key":"44_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2016.06.058","volume":"257","author":"E Zamorano","year":"2017","unstructured":"Zamorano E, Stolletz R (2017) Branch-and-price approaches for the multiperiod technician routing and scheduling problem. Eur J Oper Res 257:55\u201368","journal-title":"Eur J Oper Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00044-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00044-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00044-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:21:23Z","timestamp":1637241683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00044-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00044-x","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"18 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"1"}}