| Autor: |
Chentsov, A. G., Chentsov, A. A., Sesekin, A. N. |
| Zdroj: |
Proceedings of the Steklov Institute of Mathematics; Dec2021 Supplement 1, Vol. 315 Issue 1, pS67-S80, 14p |
| Abstrakt: |
A constrained routing problem with complicated cost functions is studied. The construction of the cost functions can be difficult, and therefore the stages of this construction are elements of the solution of the problem. This situation arises, in particular, in studying the engineering problem of dismantling radiation hazardous elements, where, in the framework of a problem statement traditional for discrete optimization, it takes an unacceptably long time to construct a cost matrix whose entries characterize the radiation doses received by performers at the stage of displacement and dismantling. It is assumed that, at the stage of the computational implementation of the resulting optimal algorithm, the corresponding "parts" of the matrix may be not fed to the computer's memory but calculated as needed. Possible applications of the developed methods may be related to the problem of dismantling a decommissioned generator unit of a nuclear power plant. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink