Geodesic
A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 50 (2017), pp. 83-109.

Voir la notice de l'article provenant de la source Math-Net.Ru

The route problem about sequential dismantling of the system of radiating elements is considered. It is assumed that this problem has a sufficiently large dimension, this makes it difficult to find exact solutions and encourages the use of heuristics. It is assumed to use an optimizing insertions with a medium dimension for the improvement of quality of these heuristics, the broadly understood dynamic programming is used within the limits of these insertions. A localization of the insertion is defined with respect to use of preceding conditions. Functions of moving costs and (internal) tasks are connected with an utilization (dismantling) of the radiation sources and are allowed a dependence on the unperformed tasks list: there are radiating only for those sources which are not dismantled at the moment of this moving or performing the task. The exposure of each radiation source which is not dismantled on the personal is inversely to the square of the distance to the radiation source; it is need to integrate this nonlinear dependence for the estimation of the radiation impact at the final stage of movements. Impacts of different radiation sources are summed.
Mots-clés : route
Keywords: trace, preceding conditions, dynamic programming. 
@article{IIMI_2017_50_a7,
     author = {A. G. Chentsov and A. A. Chentsov},
     title = {A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)},
     journal = {Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta},
     pages = {83--109},
     publisher = {mathdoc},
     volume = {50},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIMI_2017_50_a7/}
}
TY  - JOUR
AU  - A. G. Chentsov
AU  - A. A. Chentsov
TI  - A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
JO  - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
PY  - 2017
SP  - 83
EP  - 109
VL  - 50
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIMI_2017_50_a7/
LA  - ru
ID  - IIMI_2017_50_a7
ER  - 
%0 Journal Article
%A A. G. Chentsov
%A A. A. Chentsov
%T A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
%J Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
%D 2017
%P 83-109
%V 50
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIMI_2017_50_a7/
%G ru
%F IIMI_2017_50_a7
A. G. Chentsov; A. A. Chentsov. A model variant of the problem about radiation sources utilization (iterations based on optimization insertions). Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 50 (2017), pp. 83-109. http://geodesic.mathdoc.fr/item/IIMI_2017_50_a7/

[1] Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. I: Theoretical issues”, Automation and Remote Control, 50:9 (1989), 1147–1173 | MR | Zbl

[2] Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. II: Exact methods”, Automation and Remote Control, 50:10 (1989), 1303–1324 | MR | Zbl

[3] Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. Approximate algorithms”, Automation and Remote Control, 50:11 (1989), 1459–1479 | MR | Zbl

[4] Gutin G., Punnen A. P., The traveling salesman problem and its variations, Springer US, 2007 | DOI | MR | Zbl

[5] Cook W. J., In pursuit of the traveling salesman. Mathematics at the limits of computation, Princeton University Press, 2012, 248 pp. | DOI | MR | Zbl

[6] Bellman R., “Application of dynamic programming method for the traveling salesman problem”, Kibernet. Sb., 9, Mir, M., 1964, 219–228 (in Russian)

[7] Kheld M., Karp R. M., “Application of dynamic programming method for the sorting problems”, Kibernet. Sb., 9, Mir, M., 1964, 202–218 (in Russian)

[8] Little J. D. C., Murty K. G., Sweeney D. W., Karel C., “An algorithm for the traveling salesman problem”, Operations Research, 11:6 (1963), 972–989 | DOI | Zbl

[9] Chentsov A. G., Extremal problems of routing and assignment of tasks: questions of theory, Regular and Chaotic Dynamics, Institute of Computer Science, M.–Izhevsk, 2008, 240 pp.

[10] Sesekin A. N., Chentsov A. A., Chentsov A. G., “A generalized courier problem with the cost function depending on the list of tasks”, Journal of Computer and Systems Sciences International, 49:2 (2010), 234–243 | DOI | MR | Zbl

[11] Chentsov A. G., Chentsov A. A., “Route problem with constraints depending on a list of tasks”, Doklady Mathematics, 92:3 (2015), 685–688 | DOI | DOI | MR | Zbl

[12] Chentsov A. G., “Problem of successive megalopolis traversal with the precedence conditions”, Automation and Remote Control, 75:4 (2014), 728–744 | DOI | MR | Zbl

[13] Chentsov A. G., Chentsov P. A., “Routing under constraints: problem of visit to megalopolises”, Automation and Remote Control, 77:11 (2016), 1957–1974 | DOI | MR | Zbl

[14] Chentsov A. G., “The Bellmann insertions in the route problem with constraints and complicated cost functions”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 2014, no. 4, 122–141 (in Russian) | DOI | Zbl

[15] Korobkin V. V., Sesekin A. N., Tashlykov O. L., Chentsov A. G., Routing methods and their applications in problems of improving the safety and efficiency of operation of nuclear power plants, Novye Tekhnologii, M., 2012, 234 pp.

[16] Petunin A. A., “About some strategies of the programming of tool route by developing of control programs for thermal cutting machines”, Vestnik Ufimskogo Gosudarstvennogo Aviatsionnogo Tekhnicheskogo Universiteta. Seriya: Upravlenie, Vychislitel'naya Tekhnika i Informatika, 13:2(35) (2009), 280–286 (in Russian)

[17] Petunin A. A., Chentsov A. G., Chentsov P. A., “To the question about instrument routing in the automated machines of the sheet cutting”, St. Petersburg State Polytechnical University Journal. Computer Science. Telecommunication and Control Systems, 2013, no. 2(169), 103–111 (in Russian)

[18] Aleksandrov P. S., Markushevich A. I., Khinchin A. Ya., Encyclopedia of Elementary Mathematics, v. 3, Functions and Limits, GITTL, M.–L., 1952, 559 pp.

[19] Kuratowski K., Mostowski A., Set theory, North-Holland, Amsterdam, 1967, xi+417 pp. | MR | MR

[20] Dieudonne J., Foundations of modern analysis, Academic Press, New York, 2006, 408 pp. | MR

[21] Cormen T., Leiserson Ch., Rivest R., Introduction to algorithms, 1st ed., MIT Press and McGraw-Hill, 1990 | MR | Zbl

[22] Gimadi E. Kh., Khachai M. Yu., Ekstremal'nye zadachi na mnozhestvakh perestanovok, UMC UPI, Yekaterinburg, 2016, 216 pp.

[23] Chentsov A. G., “The Bellmann insertions in the route problem with constraints and complicated cost functions. II”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 26:4 (2016), 565–578 | DOI | MR | Zbl

[24] Petunin A. A., Chentsov A. A., Chentsov A. G., Chentsov P. A., “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Automation and Remote Control, 78:4 (2017), 666–681 | DOI | MR | Zbl