@article{Ribeiro2014,
abstract = {Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need regular maintenance to keep the wells at maximum productivity. When the productivity of a well decreases, a specially-equipped vehicle called a workover rig must visit this well to restore its full productivity. Given a heterogeneous fleet of workover rigs and a set of wells requiring maintenance, the workover rig routing problem (WRRP) consists of finding rig routes that minimize the total production loss of the wells over a finite horizon. The wells have different loss rates, need different services, and may not be serviced within the horizon. On the other hand, the number of available workover rigs is limited, they have different initial positions, and they do not have the same equipments. This paper presents and compares four heuristics for the WRRP: an existing variable neighborhood search heuristic, a branch-price-and-cut heuristic, an adaptive large neighborhood search heuristic, and a hybrid genetic algorithm. These heuristics are tested on practical-sized instances involving up to 300 wells, 10 rigs on a 350-period horizon. Our computational results indicate that the hybrid genetic algorithm outperforms the other heuristics on average and in most cases.},
author = {Ribeiro, G.M. and Desaulniers, G. and Desrosiers, J. and Vidal, T. and Vieira, B.S.},
doi = {10.1007/s10732-014-9262-1},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Ribeiro et al/Ribeiro et al. - 2014 - Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.pdf:pdf},
journal = {Journal of Heuristics},
number = {6},
pages = {677--708},
title = {{Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon}},
url = {https://dspace.mit.edu/openaccess-disseminate/1721.1/103514},
volume = {20},
year = {2014}
}

{"_id":"Kw2mut6pgpH3pKH57","bibbaseid":"ribeiro-desaulniers-desrosiers-vidal-vieira-efficientheuristicsfortheworkoverrigroutingproblemwithaheterogeneousfleetandafinitehorizon-2014","downloads":1,"creationDate":"2017-06-20T13:26:52.943Z","title":"Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon","author_short":["Ribeiro, G.","Desaulniers, G.","Desrosiers, J.","Vidal, T.","Vieira, B."],"year":2014,"bibtype":"article","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","bibdata":{"bibtype":"article","type":"article","abstract":"Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need regular maintenance to keep the wells at maximum productivity. When the productivity of a well decreases, a specially-equipped vehicle called a workover rig must visit this well to restore its full productivity. Given a heterogeneous fleet of workover rigs and a set of wells requiring maintenance, the workover rig routing problem (WRRP) consists of finding rig routes that minimize the total production loss of the wells over a finite horizon. The wells have different loss rates, need different services, and may not be serviced within the horizon. On the other hand, the number of available workover rigs is limited, they have different initial positions, and they do not have the same equipments. This paper presents and compares four heuristics for the WRRP: an existing variable neighborhood search heuristic, a branch-price-and-cut heuristic, an adaptive large neighborhood search heuristic, and a hybrid genetic algorithm. These heuristics are tested on practical-sized instances involving up to 300 wells, 10 rigs on a 350-period horizon. Our computational results indicate that the hybrid genetic algorithm outperforms the other heuristics on average and in most cases.","author":[{"propositions":[],"lastnames":["Ribeiro"],"firstnames":["G.M."],"suffixes":[]},{"propositions":[],"lastnames":["Desaulniers"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Desrosiers"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Vieira"],"firstnames":["B.S."],"suffixes":[]}],"doi":"10.1007/s10732-014-9262-1","file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Ribeiro et al/Ribeiro et al. - 2014 - Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.pdf:pdf","journal":"Journal of Heuristics","number":"6","pages":"677–708","title":"Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon","url":"https://dspace.mit.edu/openaccess-disseminate/1721.1/103514","volume":"20","year":"2014","bibtex":"@article{Ribeiro2014,\nabstract = {Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need regular maintenance to keep the wells at maximum productivity. When the productivity of a well decreases, a specially-equipped vehicle called a workover rig must visit this well to restore its full productivity. Given a heterogeneous fleet of workover rigs and a set of wells requiring maintenance, the workover rig routing problem (WRRP) consists of finding rig routes that minimize the total production loss of the wells over a finite horizon. The wells have different loss rates, need different services, and may not be serviced within the horizon. On the other hand, the number of available workover rigs is limited, they have different initial positions, and they do not have the same equipments. This paper presents and compares four heuristics for the WRRP: an existing variable neighborhood search heuristic, a branch-price-and-cut heuristic, an adaptive large neighborhood search heuristic, and a hybrid genetic algorithm. These heuristics are tested on practical-sized instances involving up to 300 wells, 10 rigs on a 350-period horizon. Our computational results indicate that the hybrid genetic algorithm outperforms the other heuristics on average and in most cases.},\nauthor = {Ribeiro, G.M. and Desaulniers, G. and Desrosiers, J. and Vidal, T. and Vieira, B.S.},\ndoi = {10.1007/s10732-014-9262-1},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Ribeiro et al/Ribeiro et al. - 2014 - Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.pdf:pdf},\njournal = {Journal of Heuristics},\nnumber = {6},\npages = {677--708},\ntitle = {{Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon}},\nurl = {https://dspace.mit.edu/openaccess-disseminate/1721.1/103514},\nvolume = {20},\nyear = {2014}\n}\n","author_short":["Ribeiro, G.","Desaulniers, G.","Desrosiers, J.","Vidal, T.","Vieira, B."],"key":"Ribeiro2014","id":"Ribeiro2014","bibbaseid":"ribeiro-desaulniers-desrosiers-vidal-vieira-efficientheuristicsfortheworkoverrigroutingproblemwithaheterogeneousfleetandafinitehorizon-2014","role":"author","urls":{"Paper":"https://dspace.mit.edu/openaccess-disseminate/1721.1/103514"},"metadata":{"authorlinks":{"vidal, t":"https://bibbase.org/show?bib=https%3A%2F%2Fw1.cirrelt.ca%2F%7Evidalt%2Fresources%2FMy%2520Collection.bib"}},"downloads":1},"search_terms":["efficient","heuristics","workover","rig","routing","problem","heterogeneous","fleet","finite","horizon","ribeiro","desaulniers","desrosiers","vidal","vieira"],"keywords":[],"authorIDs":["awoTsndRPACdYbwLY"],"dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"]}