Abstract
In this paper, we discuss the real-world Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) for drilling rig routing in Siberia and the Far East. There is a set of objects (exploration sites) requiring well-drilling work. Each object includes a known number of planned wells and needs to be served within a given time interval. Several drilling rigs can operate at the same object simultaneously, but their number must not exceed the number of wells planned for this object. A rig that has started the work on a well completes it to the end. The objective is to determine such a set of rig routes (including the number of assigned wells for each object) to perform all well-drilling requests, respecting the time windows, that minimizes the total traveling distance. The main difference with traditional SDVRP is that it is the service time that is split, not the demand.
We propose a mixed-integer linear programming (MILP) model for this problem. To find high-quality solutions, we design the Variable Neighborhood Search based matheuristic. Exact methods are incorporated into a local search to optimize the distribution of well work among the rigs. Time-window constraints are relaxed, allowing infeasible solutions during the search, and evaluation techniques are applied to treat them. Results of computational experiments for the algorithm and a state-of-the-art MILP solver are discussed.
The reported study was funded by RFBR and Novosibirsk region according to the research project No. 19-47-540005.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997)
Archetti, C., Speranza, M.G.: Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1–2), 3–22 (2012)
Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223–246 (2014). https://doi.org/10.1007/s13675-014-0030-7
Bramel, J., Simchi-Levi, D.: Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. 44(3), 501–509 (1996)
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)
Gendreau, M., Tarantilis, C.D.: Solving large-scale vehicle routing problems with time windows: the state-of-the-art. In: CIRRELT-2010-04, Montreal (2010)
Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-77778-8
Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2002). https://doi.org/10.1007/b101971
Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2016). https://doi.org/10.1007/s13675-016-0075-x
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, 103–120 (2014)
Ho, S., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)
Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270–287 (2008)
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)
Kulachenko, I., Kononova, P.: The VNS approach for a consistent capacitated vehicle routing problem under the shift length constraints. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds.) MOTOR 2019. CCIS, vol. 1090, pp. 51–67. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-33394-2_5
Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput. Oper. Res. 34(10), 2918–2930 (2007)
Maniezzo, V., Stützle, T., Voß, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Boston (2009). https://doi.org/10.1007/978-1-4419-1306-7
Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)
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), 724–737 (2010)
Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4, 146–154 (1992)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1985)
Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)
Talbi, E.G.: Hybrid Metaheuristics. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-30671-6
Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)
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), 475–489 (2013)
Yakici, E., Karasakal, O.: A min-max vehicle routing problem with split delivery and heterogeneous demand. Optim. Lett. 7, 1611–1625 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kulachenko, I., Kononova, P. (2020). A Matheuristic for the Drilling Rig Routing Problem. In: Kononov, A., Khachay, M., Kalyagin, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Lecture Notes in Computer Science(), vol 12095. Springer, Cham. https://doi.org/10.1007/978-3-030-49988-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-49988-4_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-49987-7
Online ISBN: 978-3-030-49988-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)