Geodesic
A hybrid algorithm for the drilling rig routing~problem
Diskretnyj analiz i issledovanie operacij, Tome 28 (2021) no. 2, pp. 35-59.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this research, the drilling rig routing problem is studied. There is a set of objects requiring well-drilling work. Each object has a time window that is the time interval during which all the work has to be started and completed. Several drilling rigs can operate at the same object simultaneously, which makes it possible to speed up the work. The objective is to determine a set of routes for a fleet of drilling rigs to perform all well-drilling requests on time and with minimal traveling costs. The mixed-integer linear programming (MILP) model is presented for this problem. To find a feasible solution we use the Variable Neighborhood Search (VNS) metaheuristic. The algorithm also includes solving an MILP subproblem to redistribute the well-drilling work. This approach combines advantages of both the exact and heuristic methods. We present the results of comparison of the algorithm with Gurobi and alternative VNS schemes. Tab. 3, illustr. 1, bibliogr. 30.
Keywords: uncapacitated vehicles, split delivery service, time windows.
Mots-clés : matheuristic 
@article{DA_2021_28_2_a1,
     author = {I. N. Kulachenko and P. A. Kononova},
     title = {A hybrid algorithm for the drilling rig routing~problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {35--59},
     publisher = {mathdoc},
     volume = {28},
     number = {2},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2021_28_2_a1/}
}
TY  - JOUR
AU  - I. N. Kulachenko
AU  - P. A. Kononova
TI  - A hybrid algorithm for the drilling rig routing~problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2021
SP  - 35
EP  - 59
VL  - 28
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2021_28_2_a1/
LA  - ru
ID  - DA_2021_28_2_a1
ER  - 
%0 Journal Article
%A I. N. Kulachenko
%A P. A. Kononova
%T A hybrid algorithm for the drilling rig routing~problem
%J Diskretnyj analiz i issledovanie operacij
%D 2021
%P 35-59
%V 28
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2021_28_2_a1/
%G ru
%F DA_2021_28_2_a1
I. N. Kulachenko; P. A. Kononova. A hybrid algorithm for the drilling rig routing~problem. Diskretnyj analiz i issledovanie operacij, Tome 28 (2021) no. 2, pp. 35-59. http://geodesic.mathdoc.fr/item/DA_2021_28_2_a1/

[1] Bräysy O., Gendreau M., “Vehicle routing problem with time windows, part I: Route construction and local search algorithms”, Transp. Sci., 39:1 (2005), 104–118 | DOI

[2] Gendreau M., Tarantilis C. D., Solving large-scale vehicle routing problems with time windows: The state-of-the-art, CIRRELT-2010-04, Interuniv. Res. Centre on Enterpr. Networks, Logist. and Transp., Montreal, 2010 | Zbl

[3] Ho S. C., Haugland D., “A tabu search heuristic for the vehicle routing problem with time windows and split deliveries”, Comput. Oper. Res., 31:12 (2004), 1947–1964 | DOI | Zbl

[4] Vidal T., Crainic T. G., Gendreau M., Prins C., “A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows”, Comput. Oper. Res., 40:1 (2013), 475–489 | DOI | MR | Zbl

[5] Kulachenko I. N., Kononova P. A., “A matheuristic for the drilling rig routing problem”, Mathematical Optimization Theory and Operations Research, Proc. 19th Int. Conf. (Novosibirsk, Russia, July 6–10, 2020), Lect. Notes Comput. Sci., 12095, Springer, Cham, 2020, 343–358 | DOI

[6] Toth P., Vigo D., Vehicle routing: Problems, methods, and applications, SIAM, Philadelphia, PA, 2014 | MR | Zbl

[7] Golden B. L., Raghavan S., Wasil E. A., The vehicle routing problem: Latest advances and new challenges, Springer, New York, 2008 | MR | Zbl

[8] Archetti C., Speranza M. G., “Vehicle routing problems with split deliveries”, Int. Trans. Oper. Res., 19:1–2 (2012), 3–22 | DOI | MR | Zbl

[9] Braekers K., Ramaekers K., Van Nieuwenhuyse I., “The vehicle routing problem: State of the art classification and review”, Comput. Ind. Eng., 99 (2016), 300–313 | DOI

[10] Lambert V., Laporte G., Louveaux F., “Designing collection routes through bank branches”, Comput. Oper. Res., 20:7 (1993), 783–791 | DOI

[11] I. N. Kulachenko, P. A. Kononova, “A hybrid local search algorithm for consistent periodic vehicle routing problem”, J. Ind. Appl. Math., 14:2 (2020), 339–351 | DOI | MR

[12] Salhi S., Imran A., Wassan N. A., “The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation”, Comput. Oper. Res., 52 (2014), 315–325 | DOI | MR | Zbl

[13] Li F., Golden B., Wasil E., “The open vehicle routing problem: Algorithms, large-scale test problems, and computational results”, Comput. Oper. Res., 34:10 (2007), 2918–2930 | DOI | MR | Zbl

[14] Yakici E., Karasakal O., “A min-max vehicle routing problem with split delivery and heterogeneous demand”, Optim. Lett., 7 (2013), 1611–1625 | DOI | MR | Zbl

[15] Aloise D. J., Aloise D., Rocha C., Ribeiro C. C., Filho R., Moura L., “Scheduling workover rigs for onshore oil production”, Discrete Appl. Math., 154:5 (2006), 695–702 | DOI | MR | Zbl

[16] Ribeiro G., Desaulniers G., Desrosiers J., Vidal T., Vieira B., “Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon”, J. Heur., 20 (2014), 677–708 | DOI

[17] Pecin D., Contardo C., Desaulniers G., Uchoa E., “New enhancements for the exact solution of the vehicle routing problem with time windows”, INFORMS J. Comput., 29:3 (2017), 489–502 | DOI | MR | Zbl

[18] Archetti C., Speranza M. G., “A survey on matheuristics for routing problems”, EURO J. Comput. Optim., 2 (2014), 223–246 | DOI | Zbl

[19] Matheuristics: Hybridizing metaheuristics and mathematical programming, Ann. Inf. Syst., 10, Springer, New York, 2009 | MR | Zbl

[20] Talbi El-G., Hybrid metaheuristics, Springer, Berlin, 2013

[21] Mladenovic N., Hansen P., “Variable neighborhood search”, Comput. Oper. Res., 24 (1997), 1097–1100 | DOI | MR | Zbl

[22] Mladenovic N., Hansen P., Todosijević R., Hanafi S., “Variable neighborhood search: Basics and variants”, EURO J. Comput. Optim., 5:3 (2017), 423–454 | DOI | MR | Zbl

[23] Hemmelmayr V. C., Doerner K. F., Hartl R. F., Vigo D., “Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management”, Transp. Sci., 48 (2014), 103–120 | DOI

[24] Talbi El-G., Metaheuristics: From design to implementation, Wiley, Hoboken, NJ, 2009 | Zbl

[25] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979 | MR | Zbl

[26] Kernighan B. W., Lin S., “An efficient heuristic procedure for partitioning graphs”, Bell Labs Tech. J., 49:2 (1970), 291–307 | DOI | Zbl

[27] Nagata Y., Bräysy O., Dullaert W., “A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows”, Comput. Oper. Res., 37:4 (2010), 724–737 | DOI | Zbl

[28] Solomon M. M., “Algorithms for the vehicle routing and scheduling problems with time window constraints”, Oper. Res., 35 (1985), 254–265 | DOI | MR

[29] Kirkpatrick S., Gelatt, Jr. C. D., Vecchi M. P., “Optimization by simulated annealing”, Science, 220:4598 (1983), 671–680 | DOI | MR | Zbl

[30] Hutter F., Hoos H. H., Leyton-Brown K., “Sequential model-based optimization for general algorithm configuration”, Learning and Intelligent Optimization, Sel. Pap. 5th Int. Conf. (Rome, Italy, Jan. 17–21, 2011), Lect. Notes Comput. Sci., 6683, Springer, Heidelberg, 2011, 507–523 | DOI