{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:22:35Z","timestamp":1774369355130,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,14]],"date-time":"2014-09-14T00:00:00Z","timestamp":1410652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10732-014-9262-1","type":"journal-article","created":{"date-parts":[[2014,9,13]],"date-time":"2014-09-13T05:28:27Z","timestamp":1410586107000},"page":"677-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon"],"prefix":"10.1007","volume":"20","author":[{"given":"Glaydston Mattos","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Desrosiers","sequence":"additional","affiliation":[]},{"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[]},{"given":"Bruno Salezze","family":"Vieira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,14]]},"reference":[{"issue":"5","key":"9262_CR1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.dam.2004.09.021","volume":"154","author":"DJ Aloise","year":"2006","unstructured":"Aloise, D.J., Aloise, D., Rocha, C.T.M., Ribeiro, C.C., Ribeiro Filho, J.C., Moura, L.S.S.: Scheduling workover rigs for onshore oil production. Discrete Appl. Math. 154(5), 695\u2013702 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"9262_CR2","first-page":"1263","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1263\u20131283 (2011)","journal-title":"Oper. Res."},{"issue":"3","key":"9262_CR3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"9262_CR4","unstructured":"Costa, L.R.: Solving the workover rigs routing problem. Master\u2019s thesis, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil (2005)"},{"key":"9262_CR5","unstructured":"Costa, L.R., Ferreira Filho, V.J.M.: A heuristic of dynamic mounting for the workover rigs routing problem. In: Proceedings of XXXVII SBPO Brazilian Symposium on Operations Research, pp. 2176\u20132187 (2005)"},{"issue":"3","key":"9262_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, partial elementarity, and generalized $$k$$ k -path inequalities for the vehicle routing problem with time windows. Transp. Sci. 42(3), 387\u2013404 (2008)","journal-title":"Transp. Sci."},{"key":"9262_CR7","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"J Desrosiers","year":"2010","unstructured":"Desrosiers, J., L\u00fcbbecke, M.E.: Branch-price-and-cut algorithms. In: Cochran, J.J., Cox Jr, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science, vol. 8. Wiley, New York, NY (2010)"},{"issue":"12","key":"9262_CR8","doi-asserted-by":"crossref","first-page":"2944","DOI":"10.1016\/j.cor.2012.02.026","volume":"39","author":"C Duhamel","year":"2012","unstructured":"Duhamel, C., Santos, A.C., Gueguen, L.M.: Models and hybrid methods for the onshore wells maintenance problem. Comput. Oper. Res. 39(12), 2944\u20132953 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9262_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145\u2013184. Kluwer Academic Publishers, Norwell (2003)"},{"issue":"2","key":"9262_CR10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2), 497\u2013511 (2008)","journal-title":"Oper. Res."},{"key":"9262_CR11","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society, American Mathematical Society, pp. 48\u201350 (1956)","DOI":"10.2307\/2033241"},{"issue":"6","key":"9262_CR12","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"11","key":"9262_CR13","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":"Comput. Oper. Res."},{"key":"9262_CR14","unstructured":"Neves, T.A.: Heuristics with adaptive memory applied to workover rig routing and scheduling problem. Master\u2019s thesis, Fluminense Federal University, Niter\u00f3i, Brazil (2007)"},{"issue":"2","key":"9262_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jncr.2010040101","volume":"1","author":"AVF Pacheco","year":"2010","unstructured":"Pacheco, A.V.F., Ribeiro, G.M., Mauri, G.R.: A GRASP with path-relinking for the workover rig scheduling problem. Int. J. Nat. Comput. Res. 1(2), 1\u201314 (2010)","journal-title":"Int. J. Nat. Comput. Res."},{"issue":"12","key":"9262_CR16","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9262_CR17","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1016\/j.cor.2012.04.010","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Desaulniers, G., Desrosiers, J.: A branch-price-and-cut algorithm for the workover rig routing problem. Comput. Oper. Res. 39(12), 3305\u20133315 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9262_CR18","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ejor.2012.01.031","volume":"220","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Laporte, G., Mauri, G.R.: A comparison of three metaheuristics for the workover rig routing problem. Eur. J. Oper. Res. 220(1), 28\u201338 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9262_CR19","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.cie.2010.12.006","volume":"60","author":"GM Ribeiro","year":"2011","unstructured":"Ribeiro, G.M., Mauri, G.R., Lorena, L.A.N.: A simple and robust simulated annealing algorithm for scheduling workover rigs on onshore oil fields. Comput. Industrial Eng. 60(4), 519\u2013526 (2011)","journal-title":"Comput. Industrial Eng."},{"issue":"3","key":"9262_CR20","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750\u2013775 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9262_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"9262_CR22","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow (1997)"},{"issue":"3","key":"9262_CR23","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9262_CR24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4), 333\u2013346 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9262_CR25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22(3), 263\u2013282 (1992)","journal-title":"Networks"},{"issue":"3","key":"9262_CR26","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 multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"9262_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9262_CR28","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9262-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9262-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9262-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:29:07Z","timestamp":1565825347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9262-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,14]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9262"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9262-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,14]]}}}