AN EXTREMAL TWO-STAGE ROUTING PROBLEM AND PROCEDURES BASED ON DYNAMIC PROGRAMMING
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
AN EXTREMAL TWO-STAGE ROUTING PROBLEM AND PROCEDURES BASED ON DYNAMIC PROGRAMMING
|
|
| Автор |
Chentsov, A. G.
Chentsov, P. A. |
|
| Тематика |
DYNAMIC PROGRAMMING
PRECEDENCE CONDITIONS ROUTE |
|
| Описание |
We study a routing problem in which the set of tasks is represented as the union of two disjoint subsets. The tasks from the first subset must be completed before the execution of the tasks from the second subset. Each task is associated with a visit to a megalopolis (a nonempty finite set) in order to perform some work. The choice of the order in which the tasks are performed is subject to precedence conditions, which are localized for the mentioned two subsets of the total set of tasks. The cost functions used in the formation of the additive criterion may involve a dependence on the list of tasks. To construct a solution, a two-stage procedure based on dynamic programming is proposed. An optimal algorithm is constructed and implemented as a computer program. A model problem about shaped sheet cutting on CNC machines is solved. © Krasovskii Institute of Mathematics and Mechanics.All rights reserved.
Russian Foundation for Basic Research, РФФИ, (20-08-00873) Received April 4, 2022 Revised April 26, 2022 Accepted April 30, 2022 Funding Agency: This work was supported by the Russian Foundation for Basic Research (project no. 20-08-00873). |
|
| Дата |
2024-04-08T11:07:50Z
2024-04-08T11:07:50Z 2022 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) Published version (info:eu-repo/semantics/publishedVersion) |
|
| Идентификатор |
Ченцов, АГ & Ченцов, ПА 2022, 'Экстремальная двухэтапная задача маршрутизации и процедуры на основе динамического программирования', Труды института математики и механики УрО РАН, Том. 28, № 2, стр. 215-248. https://doi.org/10.21538/0134-4889-2022-28-2-215-248
Ченцов, А. Г., & Ченцов, П. А. (2022). Экстремальная двухэтапная задача маршрутизации и процедуры на основе динамического программирования. Труды института математики и механики УрО РАН, 28(2), 215-248. https://doi.org/10.21538/0134-4889-2022-28-2-215-248 0134-4889 Final All Open Access; Bronze Open Access http://journal.imm.uran.ru/sites/default/files/content/28_2/TrIMMUrORAN_2022_2_p215_L.pdf http://journal.imm.uran.ru/sites/default/files/content/28_2/TrIMMUrORAN_2022_2_p215_L.pdf http://elar.urfu.ru/handle/10995/131519 48585963 10.21538/0134-4889-2022-28-2-215-248 85134836467 000905209900018 |
|
| Язык |
en
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
|
|
| Формат |
application/pdf
|
|
| Издатель |
Krasovskii Institute of Mathematics and Mechanics
|
|
| Источник |
Trudy Instituta Matematiki i Mekhaniki UrO RAN
Trudy Instituta Matematiki i Mekhaniki UrO RAN |
|