Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon
- 351 Downloads
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.
KeywordsWorkover rig routing Branch-price-and-cut heuristic Adaptive large neighborhood search Hybrid genetic algorithm Vehicle routing
Glaydston Mattos Ribeiro acknowledges the Espírito Santo Research Foundation and the National Council for Scientific and Technological Development for their financial support. Guy Desaulniers and Jacques Desrosiers acknowledge the National Science and Engineering Research Council of Canada for its financial support.
- Costa, L.R.: Solving the workover rigs routing problem. Master’s thesis, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil (2005)Google Scholar
- 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–2187 (2005)Google Scholar
- Desrosiers, J., Lübbecke, 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)Google Scholar
- Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publishers, Norwell (2003)Google Scholar
- 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–50 (1956)Google Scholar
- Neves, T.A.: Heuristics with adaptive memory applied to workover rig routing and scheduling problem. Master’s thesis, Fluminense Federal University, Niterói, Brazil (2007)Google Scholar
- Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow (1997)Google Scholar