Geodesic
The iterations method in generalized courier problem with singularity in the definition of cost functions
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 3 (2013), pp. 88-113
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of sequential megalopolis circuit with constraints in the form of preceding conditions and (interior) works realized in the megalopolises is considered. The singularity is a dependence of costs of exterior permutations and interior works on the task list. The iteration method with elements of decompositions of the joint solution defined as a pair “route-trace” is constructed.
Mots-clés : route
Keywords: iteration method, preceding conditions. 
@article{VUU_2013_3_a7,
     author = {A. A. Chentsov and A. G. Chentsov},
     title = {The iterations method in generalized courier problem with singularity in the definition of cost functions},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {88--113},
     year = {2013},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2013_3_a7/}
}
TY  - JOUR
AU  - A. A. Chentsov
AU  - A. G. Chentsov
TI  - The iterations method in generalized courier problem with singularity in the definition of cost functions
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2013
SP  - 88
EP  - 113
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VUU_2013_3_a7/
LA  - ru
ID  - VUU_2013_3_a7
ER  - 
%0 Journal Article
%A A. A. Chentsov
%A A. G. Chentsov
%T The iterations method in generalized courier problem with singularity in the definition of cost functions
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2013
%P 88-113
%N 3
%U http://geodesic.mathdoc.fr/item/VUU_2013_3_a7/
%G ru
%F VUU_2013_3_a7
A. A. Chentsov; A. G. Chentsov. The iterations method in generalized courier problem with singularity in the definition of cost functions. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 3 (2013), pp. 88-113. http://geodesic.mathdoc.fr/item/VUU_2013_3_a7/

[1] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Traveling salesman problem. Problems of theory”, Avtomatika i Telemekhanika, 1989, no. 9, 3–34 | MR

[2] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Traveling salesman problem. Exact algorithms”, Avtomatika i Telemekhanika, 1989, no. 10, 3–29 | MR | Zbl

[3] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Traveling salesman problem. Approximate algorithms”, Avtomatika i Telemekhanika, 1989, no. 11, 3–26 | MR | Zbl

[4] Tashlykov O. L., Sesekin A. N., Shcheklein S. E., Chentsov A. G., “The implementation of optimal algorithms of decommissioning of nuclear power station by means of methods of mathematical modeling”, Izv. Vyssh. Uchebn. Zaved. Yadern. Energ., 2009, no. 2, 115–120

[5] Sesekin A. N., Tashlykov O. L., Shcheklein S. E., Kuklin M. Yu., Chentsov A. G., Kadnikov A. A., “Using of dynamic programming method for the optimization of trajectory of workers movement in radiationally dangerous zones for the purpose of minimization of radioactive irradiation”, Izv. Vyssh. Uchebn. Zaved. Yadern. Energ., 2006, no. 2, 41–48

[6] Bellman R., “Application of dynamic programming method for the traveling salesman problemz”, Kibernet. Sb., 9, Mir, Moscow, 1964, 219–228

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

[8] Little J., Murty K., Sweeney D., Karel C., “An algorithm for the traveling salesman problem”, Ekonom. Mat. Met., 1:1 (1965), 90–107

[9] Chentsov A. G., Extremal problems of routing and assignment of tasks: questions of theory, Institute of Computer Science, Moscow–Izhevsk, 2008, 238 pp.

[10] Chentsov A. A., Chentsov A. G., Chentsov P. A., “The method of iterations in the problem of routing with internal losses”, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 15, no. 4, 2009, 268–287

[11] Chentsov A. A., Chentsov A. G., “To the question about solution of problem of sequential circuit of sets by means of “unclosed” traveling salesman problem”, Avtomatika i Telemekhanika, 2002, no. 11, 151–166 | MR | Zbl

[12] Chentsov A. A., Chentsov A. G., “Reduction of route optimization problems”, Avtomatika i Telemekhanika, 2000, no. 10, 136–150 | MR | Zbl

[13] Chentsov A. A., “The method of iterations in the problem of sequential circuite of sets (generalized bottleneck traveling salesman problem)”, Algorithms and software for parallel computations: Transactions, 6, Ural Branch of RAS, Ekaterinburg, 2002, 209–230 | MR

[14] Sesekin A. N., Chentsov A. A., Chentsov A. G., “Generalized courier problem with cost function that depends on the job list”, Izv. Ross. Akad. Nauk Teor. Sist. Upr., 2010, no. 2, 68–77 | MR

[15] Kuratovskii K., Mostovskii A., Theory of sets, Mir, Moscow, 1970, 416 pp. | MR

[16] Dieudonne J., Foundations of modern analysis, Mir, Moscow, 1964, 430 pp. | MR

[17] Kormen T., Leizerson Ch., Rivest R., The algorithms. Construction and analysis, Moscow Center for Continuous Mathematical Education, Moscow, 1990, 960 pp.

[18] Tashlykov O. L., Organization and technology of nuclear energetics, USTU–UPI, Ekaterinburg, 2005, 149 pp.