On one routing problem with non-additive cost aggregation

A. G. Chentsov ; A. A. Chentsov ; A. N. Sesekin

Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 13 (2020) no. 1, pp. 64-80

Résumé

We investigate the problem on sequential round of megalopolises (nonempty finite sets) with preceding conditions and nonadditive aggregation of costs. We suppose that a variant of aggregation with respect to “external” phase (by the estimation of the system of cycles, which are determined every time by the “external” movement and internal jobs) corresponds to the “bottleneck” problem with the correction parameter. At the “internal” phase (within the cycle), an aggregation of costs with respect to external movement and carrying out works can be arbitrary. We construct nonadditive variant of the procedure of dynamic programming (DP) including economical variant, which uses preceding conditions. In the form of a program for a personal computer, we realize the optimal algorithm based on DP for the statement oriented to the problem on control of an autonomous system, which works in aggressive environment and implements a sequential process of dismantling of the sources of exposures (of this environment) to the system. Such a statement can correspond to the engineering problem on sequential dismantling of the sources of radiation under emergency situations on the nuclear power plants in the case of application of the robotic system with electronic equipment, which can work only if tolerances are complied with respect to influence of radiation during entire time interval. For this variant of the general statement, we implement a calculation experiment by means of a personal computer.

Détail

Keywords: dynamic programming, preceding conditions.
Mots-clés : route

Bibliographie

[1] Melamed I. I., Sergeev S.I, Sigal I.Kh., “The Travelling Salesman Problem”, Automation and Remote Control, 50 (1989), 1147–1173 | MR | Zbl

[2] Garey R., Johnson D., Computers and Intractability, Mir, M., 1982

[3] G. Gutin, A.P. Punnen, The Traveling Salesman Problem and Its Variations, Springer, Berlin, 2002 | MR

[4] Gimadi E. H., Khachay M. Yu., Extreme Permutation Problems, UMC UPI, Ekaterinburg, 2016

[5] Bellman R., “Dynamic Programming Treatment of the Travelling Salesman Problem”, Journal of the Association for Computing Machinery, 9 (1962), 61–63 | DOI | MR | Zbl

[6] Held M., Karp R. M., “A Dynamic Programming Approach to Sequencing Problems”, Journal of the Society for Industrial and Applied Mathematics, 10:1 (1962), 196–210 | DOI | MR | Zbl

[7] Serveev S. I., “Algorithms for the Minimax Problem of the Traveling Salesman. I. An Approach Based on Dynamic Programming”, Automation and Remote Control, 56 (1995), 1027–1032 | MR | Zbl

[8] Little J., Murthy K., Sweeny D., Karel C., “An Algorithm for the Travelling Salesman Problem”, Operation Research, 11:6 (1963), 972–989 | DOI | Zbl

[9] Chentsov A. G., Chentsov A. A., “Routing of Displacements with Dynamic Constraints: “Bottleneck Problem””, Vestnik Udmurtskogo universiteta. Matematika. Mekhanika. Komp'yuternye nauki, 26:1 (2016), 121–140 (in Russian) | DOI | MR | Zbl

[10] Sesekin A. N., Chentsov A. A., Chentsov A. G., “Routing with an Abstract Function of Travel Cost Aggregation”, Trudy Instituta matematiki i mekhaniki UrO RAN, 16, no. 3, 2010, 240–264 (in Russian)

[11] Chentsov A. G., Saliy Ya. V., “A Problem on a Narrow Place”, Vserrossiiskya nauchno-prakticheskoy konferentsii “Statistika. Modelirovanie. Optimizatsiya”, Publishing center of SUSU, Chelyabinsk, 2011, 85–91 (in Russian)

[12] Chentsov A. G., Chentsov A. A., Sesekin A. N., “Dynamic Programming in the Generalized Bottleneck Problem and the Start Point Optimization”, Vestnik Udmurtskogo universiteta. Matematika. Mekhanika. Komp'yuternye nauki, 28:3 (2018), 348–363 (in Russian) | DOI | MR | Zbl

[13] Korobkin V. V., Sesekin A. N., Tashlykov O. L., Chentsov A. G., Routing Methods and Their Applications in Improving the Safety and Efficiency of Operation of Nuclear Power Plants, Noviye tekhnologii, M., 2012 (in Russian)

[14] Chentsov A. G., Chentsov A. A., “A Model Variant of the Problem about Radiation Sources Utilization (Iterations Based on Optimization Insertions)”, Izvestiya Instituta matematiki i informatiki Udmurtskogo gosudarstvennogo universiteta, 50 (2017), 83–109 (in Russian) | DOI | Zbl

[15] Chentsov A. G., Extremal Problems of Routing and Assignment of Tasks: Questions Theories, Izhevsk Institute of Computer Science, Izhevsk, 2008 (in Russian)

[16] Dieudonne J., Foundations of Modern Analysis, Academic Press, New York, 1960 | MR | Zbl

[17] Kuratowski K., Mostowski A., Sets Theory, North-Holland Publishing Company, 1967 | MR

[18] Cormen T., Leiserson Ch., Rivest R., Introduction to Algorithms, The MIT Press, London, 1990 | MR | Zbl

[19] Chentsov A. G., Chentsov P. A., “Optimization of the Start Point in the GTSP with the Precedence Conditions”, Bulletin of the South Ural State University. Series: Mathematical Modelling, Programming and Computer Software, 11:2 (2018), 83–95 (in Russian) | DOI | Zbl

[20] Chentsov A. G., Chentsov A. A., “Extremal Bottleneck Routing Problem with Constraints in the Form of Precedence Conditions”, Trudy Instituta matematiki i mekhaniki UrO RAN, 14, no. 2, 2008, 129–142 (in Russian) | Zbl

[21] Cheblokov I. B., Chentsov A. G., “About One Route Problem with Interior Works”, Vestnik Udmurtskogo universiteta. Matematika. Mekhanika. Komp'yuternye nauki, 2012, no. 1, 96–119 (in Russian) | DOI | Zbl

[22] Chentsov A. G., “To Question of Routing of Works Complexes”, Vestnik Udmurtskogo universiteta. Matematika. Mekhanika. Komp'yuternye nauki, 2013, no. 1, 59–82 (in Russian) | DOI | MR | Zbl

[23] E.L. Lawler, “Efficient Implementation of Dynamic Programming Algorithms for Sequencing Problems”, Stichting Mathematisch Centrum, 1979, 1–16

[24] Chentsov A. G., Chentsov A. A., “To the Question of Finding the Value of a Route Problem with Restrictions”, Problemy upravleniya i informatiki, 2016, no. 1, 41–54 (in Russian) | MR