Skip to main content
SpringerLink
Log in

A Matheuristic for the Drilling Rig Routing Problem

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12095))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997)

    MATH  Google Scholar 

  2. Archetti, C., Speranza, M.G.: Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1–2), 3–22 (2012)

    Article  MathSciNet  Google Scholar 

  3. 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

    Article  MATH  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. 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)

    Google Scholar 

  7. 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

    Book  MATH  Google Scholar 

  8. Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2002). https://doi.org/10.1007/b101971

    Book  MATH  Google Scholar 

  9. 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

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270–287 (2008)

    Article  MathSciNet  Google Scholar 

  13. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)

    Article  Google Scholar 

  14. 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

    Chapter  Google Scholar 

  15. 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)

    Article  Google Scholar 

  16. 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

    Book  MATH  Google Scholar 

  17. Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  18. 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)

    Article  Google Scholar 

  19. Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4, 146–154 (1992)

    Article  Google Scholar 

  20. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1985)

    Article  MathSciNet  Google Scholar 

  21. Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)

    Book  Google Scholar 

  22. Talbi, E.G.: Hybrid Metaheuristics. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-30671-6

  23. Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)

    MATH  Google Scholar 

  24. 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)

    Article  MathSciNet  Google Scholar 

  25. Yakici, E., Karasakal, O.: A min-max vehicle routing problem with split delivery and heterogeneous demand. Optim. Lett. 7, 1611–1625 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, Russia

    Igor Kulachenko & Polina Kononova

  2. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Polina Kononova

Authors
  1. Igor Kulachenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Polina Kononova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Polina Kononova .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Alexander Kononov

  2. Krasovsky Institute of Mathematics and Mechanics, Yekaterinburg, Russia

    Michael Khachay

  3. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A Kalyagin

  4. University of Florida, Gainesville, FL, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics

Search

Navigation