Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102527
Title: Optimal routing in a problem with constraints and cost functions depending on the task list
Authors: Chentsov, A. A.
Chentsov, A. G.
Sesekin, A. N.
Issue Date: 2021
Publisher: IOP Publishing Ltd
Citation: Chentsov A. A. Optimal routing in a problem with constraints and cost functions depending on the task list / A. A. Chentsov, A. G. Chentsov, A. N. Sesekin. — DOI 10.1088/1742-6596/1864/1/012050 // Journal of Physics: Conference Series. — 2021. — Vol. 1864. — Iss. 1. — 012050.
Abstract: A routing problem with precedence conditions and complex cost functions is considered. In this problem, we must choose a starting point, a route (permutation of indices) and a specific trajectory for our process. This trajectory must be consistent with the route. In addition, this route or index permutation defines the sequence of tasks. In addition, the selection of the above route must satisfy the precedence conditions defined by the system of ordered index pairs. These ordered pairs are called address pairs. We consider the additive criterion routing problem. This criterion is natural for the problem of dismantling the system of radiation sources. In this article, we will focus on this engineering problem. In this problem very naturally cost functions arise with a dependency on the list of tasks. Namely, each time the performer touches those and only those sources that were not dismantled at that time. The solution uses widely understood dynamic programming. We build the optimal algorithm for the PC; information about the computational experiment is given. © Published under licence by IOP Publishing Ltd.
Keywords: DYNAMIC PROGRAMMING
COMPUTATIONAL EXPERIMENT
ENGINEERING PROBLEMS
OPTIMAL ALGORITHM
OPTIMAL ROUTING
ORDERED PAIRS
RADIATION SOURCE
ROUTING PROBLEMS
COST FUNCTIONS
URI: http://hdl.handle.net/10995/102527
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85107402820
PURE ID: 22112783
c8d58d3f-a27e-4c73-a8d3-f1b482cdb651
ISSN: 17426588
DOI: 10.1088/1742-6596/1864/1/012050
metadata.dc.description.sponsorship: The research was supported by Russian Foundation for Basic Research, project no. 19-01-00573.
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85107402820.pdf597,6 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.