An adaptive large neighborhood search for the robust rig routing Научная публикация
| Журнал |
Expert Systems with Applications
ISSN: 0957-4174 , E-ISSN: 1873-6793 |
||
|---|---|---|---|
| Вых. Данные | Год: 2023, Том: 231, Страницы: 120626 Страниц : 11 DOI: 10.1016/j.eswa.2023.120626 | ||
| Ключевые слова | Logistics, Threshold robustness, Uncapacitated vehicles, Split delivery, Time windows, Metaheuristics | ||
| Авторы |
|
||
| Организации |
|
Информация о финансировании (1)
| 1 | Российский научный фонд | 21-41-09017 |
Реферат:
In the oil and gas industry, there is a need for constructing auxiliary maintenance and storage buildings nearby exploration sites. As the initial stage for such constructing purposes, it is required to drill wells for construction piles. To this end, there is a fleet of mobile drilling rigs traveling from one exploration site to another, performing the work on drilling wells. For each site, we have a time window for completing all the work on drilling. To complete all the work among all the exploration sites in time, it may be necessary to allow several drilling rigs to perform work at the same site. Yet, in the real world, unforeseen circumstances can affect drilling time, and that, if disregarded, can lead to a disruption of the work plan. Thus, in this problem, we maximize possible deviations of drilling times from expected values when there is still a feasible solution to perform all well-drilling requests in time. At the same time, total traveling costs must be no more than a given threshold. It is a so-called threshold robustness approach. The described Drilling Rig Routing Problem (DRRP) differs from other well-studied variants of Vehicle Routing Problem (VRP) in that the work splitting affects the service time. There is a limited number of papers dealing with such problems and no papers about the robust formulation for them. This research proposes a mathematical model for the novel formulation of the DRRP with uncertainties and an Adaptive Large Neighborhood Search (ALNS) algorithm to solve it. The destruction operators work either at the route, customer, or visit level. The reconstruction operators take into account a possibility to change the work partition. Computational results for the algorithm and Gurobi solver show the dominance of the ALNS scheme for medium- and large-sized instances.
Библиографическая ссылка:
Kulachenko I.
, Kononova P.
An adaptive large neighborhood search for the robust rig routing
Expert Systems with Applications. 2023. V.231. P.120626. DOI: 10.1016/j.eswa.2023.120626 WOS Scopus РИНЦ OpenAlex
An adaptive large neighborhood search for the robust rig routing
Expert Systems with Applications. 2023. V.231. P.120626. DOI: 10.1016/j.eswa.2023.120626 WOS Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 1 мая 2022 г. |
| Принята к публикации: | 27 мая 2023 г. |
| Опубликована online: | 2 июн. 2023 г. |
| Опубликована в печати: | 15 июн. 2023 г. |
Идентификаторы БД:
| Web of science: | WOS:001022128800001 |
| Scopus: | 2-s2.0-85163706434 |
| РИНЦ: | 62560866 |
| OpenAlex: | W4379141240 |