Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2021, Volume 28, Issue 2, Pages 35–59
DOI: https://doi.org/10.33048/daio.2021.28.703 (Mi da1276) 		 
This article is cited in 6 scientific papers (total in 6 papers)

A hybrid algorithm for the drilling rig routing problem

I. N. Kulachenkoab, P. A. Kononovaab

a Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
b Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
Full-text PDF (443 kB) Citations (6)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2021.28.703
Abstract: 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, matheuristic, split delivery service, time windows.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 0314-2019-0014
This research is carried out within the framework of the state contract of the Sobolev Institute of Mathematics (Project 0314–2019–0014).
Received: 13.11.2020
Revised: 15.02.2021
Accepted: 17.02.2021
English version:
Journal of Applied and Industrial Mathematics, 2021, Volume 15, Issue 2, Pages 261–276
DOI: https://doi.org/10.1134/S1990478921020071
Bibliographic databases:
Document Type: Article
UDC: 519.8+518.25
Language: Russian
Citation: I. N. Kulachenko, P. A. Kononova, “A hybrid algorithm for the drilling rig routing problem”, Diskretn. Anal. Issled. Oper., 28:2 (2021), 35–59; J. Appl. Industr. Math., 15:2 (2021), 261–276
Citation in format AMSBIB
\Bibitem{KulKon21}
\by I.~N.~Kulachenko, P.~A.~Kononova
\paper A hybrid algorithm for the drilling rig routing~problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2021
\vol 28
\issue 2
\pages 35--59
\mathnet{http://mi.mathnet.ru/da1276}
\crossref{https://doi.org/10.33048/daio.2021.28.703}
\transl
\jour J. Appl. Industr. Math.
\yr 2021
\vol 15
\issue 2
\pages 261--276
\crossref{https://doi.org/10.1134/S1990478921020071}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85117140306}
Linking options:
  • https://www.mathnet.ru/eng/da1276
  • https://www.mathnet.ru/eng/da/v28/i2/p35
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024