Abstract
We consider a real-world vehicle routing problem with time windows, arising in drilling rigs routing and well servicing on a set of sites with different geographical locations. Each site includes a predetermined number of wells which must be processed within a given time window. The same rig can visit a site several times, but the overall number of site visits by rigs is bounded from above. Each well is drilled by one rig without preemptions. It is required to find the routes of the rigs, minimizing the total traveling distance. We also consider a stochastic generalization of the problem, where the drilling times are supposed to be random variables with known discrete distributions. New mixed-integer linear programming models are formulated and tested experimentally. A randomized greedy algorithm is proposed for approximate solving the problem in stochastic formulation, if the number of possible realizations of drilling times is so high that existing MIP solvers are not suitable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The choice of this solver was based on a preliminary experiment, which indicated that on the MIP instances considered here Gurobi has an advantage to other solvers available to us (e.g. it was approximately twice as fast in comparison with CPLEX 12.10.0.0).
References
Bassi, H.V., Ferreira Filho, V.J.M., Bahiense, L.: Planning and scheduling a fleet of rigs using simulation-optimization. Comput. Ind. Eng. 63(4), 1074–1088 (2012)
Borisovsky, P.A., Eremeev, A.V., Kallrath, J.: Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic. Int. J. Prod. Res. 58(9), 2677–2695 (2020)
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., Rousseau, L.-M.: The vehicle routing problem with hard time windows and stochastic service times. EURO J. Transp. Logist. 7(3), 223–251 (2016). https://doi.org/10.1007/s13676-016-0101-4
Iyer, R.R., Grossmann, I.E., Vasantharajan, S., Cullick, A.S.: Optimal planning and scheduling of offshore oil field infrastructure investment and operations. Ind. Eng. Chem. Res. 37(4), 1380–1397 (1998)
Ierapetritou, M.G., Floudas, C.A.: Effective continuous-time formulation for short-term scheduling: I. Multipurpose batch process. Ind. Eng. Chem. Res. 37(11), 4341–4359 (1998)
Kibzun, A.I., Naumov, A.V., Norkin, V.I.: On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem. Autom. Remote Control 74, 951–967 (2013)
Kulachenko, I., Kononova, P.: A matheuristic for the drilling rig routing problem. In: Kononov, A., Khachay, M., Kalyagin, V.A., Pardalos, P. (eds.) MOTOR 2020. LNCS, vol. 12095, pp. 343–358. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-49988-4_24
Kulachenko, I., Kononova, P.: A hybrid algorithm for drilling rig routing problem. Diskretny Analys i Issledovanie Operacii (2021, to appear). (in Russian)
Laporte, G., Louveaux, F., Mercure, H.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Transp. Sci. 26(3), 161–170 (1992)
Nasri, M., Metrane, A., Hafidi, I., Jamali, A.: A robust approach for solving a vehicle routing problem with time windows with uncertain service and travel times. Int. J. Ind. Eng. Comput. 11, 1–16 (2020)
Oyola, J., Arntzen, H., Woodruff, D.L.: The stochastic vehicle routing problem, a literature review, part I: models. EURO J. Transp. Logist. 7(3), 193–221 (2016). https://doi.org/10.1007/s13676-016-0100-5
Shaik, M.A., Floudas, C.A., Kallrath, J., Pitz, H.J.: Production scheduling of a large-scale industrial continuous plant: short-term and medium-term scheduling. Comput. Chem. Eng. 33, 670–686 (2009)
Souyris, S., Cortés, C.E., Ordóñez, F., Weintraub, A.: A robust optimization approach to dispatching technicians under stochastic service times. Optim. Lett. 7(7), 1549–1568 (2012). https://doi.org/10.1007/s11590-012-0557-6
Tavallali, M.S., Zare, M.: Planning the drilling rig activities - routing and allocation. Comput. Aided Chem. Eng. 43, 1219–1224 (2018)
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, pp. 157–193. SIAM (2002)
Acknowledgement
The research is supported by Russian Science Foundation grant 21-41-09017. A server of Sobolev Institute of Mathematics, Omsk Branch is used for computing.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Borisovsky, P., Eremeev, A., Kovalenko, Y., Zaozerskaya, L. (2021). Rig Routing with Possible Returns and Stochastic Drilling Times. In: Pardalos, P., Khachay, M., Kazakov, A. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science(), vol 12755. Springer, Cham. https://doi.org/10.1007/978-3-030-77876-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-77876-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77875-0
Online ISBN: 978-3-030-77876-7
eBook Packages: Computer ScienceComputer Science (R0)