A Hybrid Algorithm for the Drilling Rig Routing Problem

Standard

A Hybrid Algorithm for the Drilling Rig Routing Problem. / Kulachenko, I. N.; Kononova, P. A.

In: Journal of Applied and Industrial Mathematics, Vol. 15, No. 2, 04.2021, p. 261-276.

Research output: Contribution to journal › Article › peer-review

Harvard

Kulachenko, IN & Kononova, PA 2021, 'A Hybrid Algorithm for the Drilling Rig Routing Problem', Journal of Applied and Industrial Mathematics, vol. 15, no. 2, pp. 261-276. https://doi.org/10.1134/S1990478921020071

APA

Kulachenko, I. N., & Kononova, P. A. (2021). A Hybrid Algorithm for the Drilling Rig Routing Problem. Journal of Applied and Industrial Mathematics, 15(2), 261-276. https://doi.org/10.1134/S1990478921020071

Vancouver

Kulachenko IN , Kononova PA. A Hybrid Algorithm for the Drilling Rig Routing Problem. Journal of Applied and Industrial Mathematics. 2021 Apr;15(2):261-276. doi: 10.1134/S1990478921020071

Author

Kulachenko, I. N. ; Kononova, P. A. / A Hybrid Algorithm for the Drilling Rig Routing Problem. In: Journal of Applied and Industrial Mathematics. 2021 ; Vol. 15, No. 2. pp. 261-276.

BibTeX

@article{8a8e9fb8d2054b8f89b248162aa3f358,

title = "A Hybrid Algorithm for the Drilling Rig Routing Problem",

abstract = "Under study is the drilling rig routing problem. We are given a set of facilities requiringwell-drilling work and a time window (i.e., some time interval during which all work has to becompleted). Several drilling rigs can operate at the same facility simultaneously, which allows usto speed up the work. The objective is to determine a set of routes for a fleet of drilling rigs toperform all well-drilling requests in time with minimal total traveling time. We constructed themixed integer linear programming (MILP) model for this problem. To find a feasible solution,we use the variable neighborhood search (VNS)metaheuristic. The algorithm also includes solving some MILP subproblem to redistribute thewell-drilling work. The obtained method combines the advantages of both exact and heuristicapproaches. We present the results of comparison of the developed algorithm with Gurobi andalternative VNS schemes.",

keywords = "matheuristics, split delivery service, time window, uncapacitated vehicle",

author = "Kulachenko, {I. N.} and Kononova, {P. A.}",

note = "Funding Information: The authors were supported by the State Task to the Sobolev Institute of Mathematics (project no. 0314–2019–0014). Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd.",

year = "2021",

month = apr,

doi = "10.1134/S1990478921020071",

language = "English",

volume = "15",

pages = "261--276",

journal = "Journal of Applied and Industrial Mathematics",

issn = "1990-4789",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "2",

}

RIS

TY - JOUR

T1 - A Hybrid Algorithm for the Drilling Rig Routing Problem

AU - Kulachenko, I. N.

AU - Kononova, P. A.

PY - 2021/4

Y1 - 2021/4

N2 - Under study is the drilling rig routing problem. We are given a set of facilities requiringwell-drilling work and a time window (i.e., some time interval during which all work has to becompleted). Several drilling rigs can operate at the same facility simultaneously, which allows usto speed up the work. The objective is to determine a set of routes for a fleet of drilling rigs toperform all well-drilling requests in time with minimal total traveling time. We constructed themixed integer linear programming (MILP) model for this problem. To find a feasible solution,we use the variable neighborhood search (VNS)metaheuristic. The algorithm also includes solving some MILP subproblem to redistribute thewell-drilling work. The obtained method combines the advantages of both exact and heuristicapproaches. We present the results of comparison of the developed algorithm with Gurobi andalternative VNS schemes.

AB - Under study is the drilling rig routing problem. We are given a set of facilities requiringwell-drilling work and a time window (i.e., some time interval during which all work has to becompleted). Several drilling rigs can operate at the same facility simultaneously, which allows usto speed up the work. The objective is to determine a set of routes for a fleet of drilling rigs toperform all well-drilling requests in time with minimal total traveling time. We constructed themixed integer linear programming (MILP) model for this problem. To find a feasible solution,we use the variable neighborhood search (VNS)metaheuristic. The algorithm also includes solving some MILP subproblem to redistribute thewell-drilling work. The obtained method combines the advantages of both exact and heuristicapproaches. We present the results of comparison of the developed algorithm with Gurobi andalternative VNS schemes.

KW - matheuristics

KW - split delivery service

KW - time window

KW - uncapacitated vehicle

UR - http://www.scopus.com/inward/record.url?scp=85117140306&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/927e1090-2d01-3d1e-80f2-47c355d08613/

U2 - 10.1134/S1990478921020071

DO - 10.1134/S1990478921020071

M3 - Article

AN - SCOPUS:85117140306

VL - 15

SP - 261

EP - 276

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 2

ER -

ID: 34569614