{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T23:34:17Z","timestamp":1726356857052},"reference-count":53,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001807","name":"S\u00e3o Paulo Research Foundation","doi-asserted-by":"publisher","award":["2015\/26453-7","2016\/15966-6","2016\/23366-9"],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["141973\/2016-1","304601\/2017-9"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000286","name":"British Academy","doi-asserted-by":"publisher","award":["SRG18R1\\180939"],"id":[{"id":"10.13039\/501100000286","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.cor.2020.104935","type":"journal-article","created":{"date-parts":[[2020,2,27]],"date-time":"2020-02-27T07:34:46Z","timestamp":1582788886000},"page":"104935","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["Decomposition-based algorithms for the crew scheduling and routing problem in road restoration"],"prefix":"10.1016","volume":"119","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0500-3238","authenticated-orcid":false,"given":"Alfredo","family":"Moreno","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5929-593X","authenticated-orcid":false,"given":"Pedro","family":"Munari","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9490-0998","authenticated-orcid":false,"given":"Douglas","family":"Alem","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2020.104935_bib0001","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/opre.2015.1401","article-title":"Benders Decomposition for Production Routing Under Demand Uncertainty","volume":"63","author":"Adulyasak","year":"2015","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0002","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.cor.2017.01.007","article-title":"Multi-vehicle prize collecting arc routing for connectivity problem","volume":"82","author":"Akbari","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0003","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2016.07.043","article-title":"Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity","volume":"257","author":"Akbari","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2020.104935_bib0004","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1111\/itor.12547","article-title":"Iterated local search and simulated annealing algorithms for the inventory routing problem","volume":"25","author":"Alvarez","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0005","unstructured":"Applegate, D., Bixby, R., Chv\u00e0tal, V., Cook, W., 2018. Concorde TSP solver. Accessed on 01\/02\/2018."},{"key":"10.1016\/j.cor.2020.104935_bib0006","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1016\/j.trb.2016.09.001","article-title":"A Benders decomposition approach for the charging station location problem with plug-in hybrid electric vehicles","volume":"93","author":"Arslan","year":"2016","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0007","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10288-011-0182-8","article-title":"A simulated annealing hyper-heuristic methodology for flexible decision support","volume":"10","author":"Bai","year":"2012","journal-title":"4OR"},{"issue":"17","key":"10.1016\/j.cor.2020.104935_bib0008","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1016\/j.ins.2011.04.010","article-title":"Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation","volume":"181","author":"Balin","year":"2011","journal-title":"Inf. Sci."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0009","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10589-009-9238-5","article-title":"How much do we \u201cpay\u201d for using default parameters?","volume":"48","author":"Baz","year":"2009","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2020.104935_bib0010","series-title":"Hyper-Heuristics: An Emerging Direction in Modern Search Technology","first-page":"457","author":"Burke","year":"2003"},{"key":"10.1016\/j.cor.2020.104935_bib0011","series-title":"Practical Nonparametric Statistics","author":"Conover","year":"1999"},{"issue":"4","key":"10.1016\/j.cor.2020.104935_bib0012","first-page":"393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"J. Oper. Res. Soc.Am."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0013","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cor.2020.104935_bib0014","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","article-title":"A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation","volume":"179","author":"Dowsland","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2019.07.073","article-title":"Recent Advances in Selection Hyper-heuristics","author":"Drake","year":"2019","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0016","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1287\/trsc.2015.0636","article-title":"A benders decomposition approach for the symmetric TSP with generalized latency arising in the design of semiflexible transit systems","volume":"51","author":"Errico","year":"2017","journal-title":"Transp. Sci."},{"issue":"7","key":"10.1016\/j.cor.2020.104935_bib0017","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.1287\/mnsc.2016.2461","article-title":"Redesigning benders decomposition for large-scale facility location","volume":"63","author":"Fischetti","year":"2017","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0018","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0305-0548(03)00200-4","article-title":"Towards unified formulations and extensions of two classical probabilistic location models","volume":"32","author":"Galv\u00e3o","year":"2005","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2020.104935_bib0019","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","article-title":"Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem","volume":"26","author":"Gendron","year":"2014","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0020","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ejor.2016.04.058","article-title":"A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks","volume":"255","author":"Gendron","year":"2016","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2020.104935_bib0021","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/0952813X.2013.782347","article-title":"Metaheuristics: review and application","volume":"25","author":"Gogna","year":"2013","journal-title":"J. Exp. Theoret. Artif.Intell."},{"key":"10.1016\/j.cor.2020.104935_bib0022","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/978-3-540-24581-0_69","article-title":"Guided operators for a hyper-heuristic genetic algorithm","volume":"2903","author":"Han","year":"2003"},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0023","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","article-title":"Paramils: an automatic algorithm configuration framework","volume":"36","author":"Hutter","year":"2009","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0024","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.trc.2018.07.007","article-title":"A decision support approach for condition-based maintenance of rails based on big data analysis","volume":"95","author":"Jamshidi","year":"2018","journal-title":"Transp. Res. Part C: Emerging Technol."},{"key":"10.1016\/j.cor.2020.104935_bib0025","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","article-title":"A survey of genetic algorithms for solving multi depot vehicle routing problem","volume":"27","author":"Karakati\u010d","year":"2015","journal-title":"Appl. Soft Comput. J."},{"key":"10.1016\/j.cor.2020.104935_bib0026","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.tre.2016.09.012","article-title":"Arc routing problems to restore connectivity of a road network","volume":"95","author":"Kasaei","year":"2016","journal-title":"Transp. Res. Part E: Logist.Transp. Rev."},{"key":"10.1016\/j.cor.2020.104935_bib0027","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.apm.2018.07.047","article-title":"Network repair crew scheduling for short-term disasters","volume":"64","author":"Kim","year":"2018","journal-title":"Appl. Math. Model."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0028","first-page":"98","article-title":"A Comparative Analysis of PMX, CX and OX Crossover operators for solving Travelling Salesman Problem","volume":"1","author":"Kumar","year":"2012","journal-title":"Int. J. Latest Res. Sci. Technol."},{"issue":"Holland 1975","key":"10.1016\/j.cor.2020.104935_bib0029","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: a review of representations and operators","volume":"13","author":"Larranaga","year":"1999","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.cor.2020.104935_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2018.05.005","article-title":"The generalized rollon-rolloff vehicle routing problem and savings-based algorithm","volume":"113","author":"Li","year":"2018","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0031","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/ijoc.1020.0024","article-title":"A hybrid genetic\/optimization algorithm for finite-horizon, partially observed Markov decision processes","volume":"16","author":"Lin","year":"2004","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0032","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.ejor.2015.06.026","article-title":"Network repair crew scheduling and routing for emergency relief distribution problem","volume":"248","author":"Maya-Duque","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0033","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.asoc.2013.12.017","article-title":"A beginner\u2019s guide to tuning methods","volume":"17","author":"Montero","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2020.104935_bib0034","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.cor.2015.12.002","article-title":"Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics","volume":"69","author":"Moreno","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2020.104935_bib0035","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1016\/j.ejor.2018.02.022","article-title":"An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains","volume":"269","author":"Moreno","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0036","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ejor.2018.11.004","article-title":"A branch-and-benders-cut algorithm for the crew scheduling and routing problem in road restoration","volume":"275","author":"Moreno","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2020.104935_bib0037","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.trb.2018.10.001","article-title":"Work crew routing problem for infrastructure network restoration","volume":"118","author":"Morshedlou","year":"2018","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0038","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/ijoc.1050.0145","article-title":"A compressed-annealing heuristic for the traveling salesman problem with time windows","volume":"19","author":"Ohlmann","year":"2007","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2020.104935_bib0039","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.cor.2007.11.008","article-title":"A comparative analysis of several asymmetric traveling salesman problem formulations","volume":"36","author":"\u00d6ncan","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.cor.2020.104935_bib0040","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.seps.2014.08.001","article-title":"Coordinating debris cleanup operations in post disaster road networks","volume":"48","author":"\u00d6zdamar","year":"2014","journal-title":"Socio-Econ. Plan. Sci."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0041","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","article-title":"Improving benders decomposition using a genetic algorithm","volume":"199","author":"Poojari","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0042","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1080\/12265934.2014.929507","article-title":"Model of debris collection operation after disasters and its application in urban area","volume":"18","author":"Pramudita","year":"2014","journal-title":"Int. J. Urban Sci."},{"issue":"5","key":"10.1016\/j.cor.2020.104935_bib0043","first-page":"805","article-title":"Undirected capacitated arc routing problems in debris collection operation after disaster","volume":"68","author":"Pramudita","year":"2012","journal-title":"Infrastruct. Plan. Manage."},{"issue":"3","key":"10.1016\/j.cor.2020.104935_bib0044","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The Benders decomposition algorithm: a literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0045","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2014.12.005","article-title":"Decomposition based hybrid metaheuristics","volume":"244","author":"Raidl","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104935_bib0046","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.1080.0296","article-title":"Accelerating Benders Decomposition by Local Branching","volume":"21","author":"Rei","year":"2009","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2020.104935_bib0047","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.trb.2015.02.014","article-title":"The split-demand one-commodity pickup-and-delivery travelling salesman problem","volume":"75","author":"Salazar-Gonz\u00e1lez","year":"2015","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"10.1016\/j.cor.2020.104935_bib0048","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/trsc.2015.0623","article-title":"A novel model and decomposition approach for the integrated airline fleet assignment, aircraft routing, and crew pairing problem","volume":"51","author":"Shao","year":"2017","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2020.104935_bib0049","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.cor.2019.01.015","article-title":"Integrated optimal scheduling of repair crew and relief vehicle after disaster","volume":"105","author":"Shin","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"June","key":"10.1016\/j.cor.2020.104935_bib0050","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.trc.2019.05.045","article-title":"Integrated condition-based track maintenance planning and crew scheduling of railway networks","volume":"105","author":"Su","year":"2019","journal-title":"Transp. Res. Part C: Emerg.Technol."},{"issue":"9","key":"10.1016\/j.cor.2020.104935_bib0051","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.cor.2011.07.005","article-title":"Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures","volume":"40","author":"Ta\u015fkin","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2020.104935_bib0052","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1109\/TITS.2014.2313628","article-title":"Optimal scheduling for highway emergency repairs under large-scale supply-demand perturbations","volume":"15","author":"Yan","year":"2014","journal-title":"IEEE Trans. Intell. Transp.Syst."},{"key":"10.1016\/j.cor.2020.104935_bib0053","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.trb.2019.07.010","article-title":"Microscopic optimization model and algorithm for integrating train timetabling and track maintenance task scheduling","volume":"127","author":"Zhang","year":"2019","journal-title":"Transp. Res. Part B: Methodol."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T22:10:09Z","timestamp":1586729409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054820300526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":53,"alternative-id":["S0305054820300526"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2020.104935","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decomposition-based algorithms for the crew scheduling and routing problem in road restoration","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2020.104935","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104935"}}