Advertisement

Journal of Heuristics

, Volume 20, Issue 6, pp 677–708 | Cite as

Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon

  • Glaydston Mattos Ribeiro
  • Guy Desaulniers
  • Jacques Desrosiers
  • Thibaut Vidal
  • Bruno Salezze Vieira
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.

Keywords

Workover rig routing Branch-price-and-cut heuristic  Adaptive large neighborhood search Hybrid genetic algorithm Vehicle routing 

Notes

Acknowledgments

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.

References

  1. 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–702 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  2. Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1263–1283 (2011)MathSciNetGoogle Scholar
  3. 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–329 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 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
  5. 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
  6. Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, partial elementarity, and generalized \(k\)-path inequalities for the vehicle routing problem with time windows. Transp. Sci. 42(3), 387–404 (2008)CrossRefGoogle Scholar
  7. 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
  8. Duhamel, C., Santos, A.C., Gueguen, L.M.: Models and hybrid methods for the onshore wells maintenance problem. Comput. Oper. Res. 39(12), 2944–2953 (2012)CrossRefMathSciNetGoogle Scholar
  9. 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
  10. 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–511 (2008)CrossRefzbMATHGoogle Scholar
  11. 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
  12. Lübbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007–1023 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  13. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 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
  15. 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–14 (2010)CrossRefGoogle Scholar
  16. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 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–3315 (2012)CrossRefGoogle Scholar
  18. 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–38 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 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–526 (2011)CrossRefGoogle Scholar
  20. Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750–775 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  21. Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555–565 (1976)CrossRefzbMATHMathSciNetGoogle Scholar
  22. Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow (1997)Google Scholar
  23. 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–520 (2012)CrossRefzbMATHGoogle Scholar
  24. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4), 333–346 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  25. Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22(3), 263–282 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  26. 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–624 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  27. 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–21 (2014)CrossRefMathSciNetGoogle Scholar
  28. 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–673 (2014)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Glaydston Mattos Ribeiro
    • 1
  • Guy Desaulniers
    • 2
  • Jacques Desrosiers
    • 3
  • Thibaut Vidal
    • 4
  • Bruno Salezze Vieira
    • 5
  1. 1.Transportation Engineering ProgramFederal University of Rio de JaneiroRio de JaneiroBrazil
  2. 2.Department of Mathematics and Industrial Engineering and GERADÉcole Polytechnique de MontréalMontrealCanada
  3. 3.Department of Management Sciences and GERADHEC MontréalMontrealCanada
  4. 4.Massachusetts Institute of TechnologyMITCambridgeUSA
  5. 5.Department of Computer Engineering and ElectronicsFederal University of Espírito SantoSão MateusBrazil

Personalised recommendations