Geodesic
To question of routing of works complexes
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2013), pp. 59-82 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The complicated variant of the problem of sequential megalopolis circuit with constraints in the form of preceding conditions is considered. The additional constraints on the junction character for fragments of exterior permutations and interior works (with respect to megalopolis) are imposed upon. It is supposed that costs of exterior permutations and interior works depend on the task list explicitly. The procedure of the dynamic programming type and (on their base) algorithm on the functional level are constructed.
Mots-clés : route
Keywords: dynamic programming, preceding conditions. 
@article{VUU_2013_1_a6,
     author = {A. G. Chentsov},
     title = {To question of routing of works complexes},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {59--82},
     year = {2013},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - To question of routing of works complexes
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2013
SP  - 59
EP  - 82
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/
LA  - ru
ID  - VUU_2013_1_a6
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T To question of routing of works complexes
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2013
%P 59-82
%N 1
%U http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/
%G ru
%F VUU_2013_1_a6
A. G. Chentsov. To question of routing of works complexes. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2013), pp. 59-82. http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/

[1] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Voprosy teorii”, Avtomatika i telemekhanika, 1989, no. 9, 3–34 | MR

[2] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Tochnye algoritmy”, Avtomatika i telemekhanika, 1989, no. 10, 3–29 | MR | Zbl

[3] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Priblizhennye algoritmy”, Avtomatika i telemekhanika, 1989, no. 11, 3–26 | MR | Zbl

[4] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982, 416 pp. | MR

[5] Litl Dzh., Murti K., Suini D., Kerel K., “Algoritm dlya resheniya zadachi o kommivoyazhere”, Ekonomika i matematicheskie metody, 1:1 (1965), 90–107

[6] Bellman R., “Primenenie dinamicheskogo programmirovaniya k zadache o kommivoyazhere”, Kiberneticheskii sbornik, 9, Mir, M., 1964, 219–228

[7] Kheld M., Karp R. M., “Primenenie dinamicheskogo programmirovaniya k zadacham uporyadocheniya”, Kiberneticheskii sbornik, 9, Mir, M., 1964, 202–218

[8] Tashlykov O. L., Remont oborudovaniya atomnykh stantsii, Ucheb. posobie dlya vuzov, UGTU–UPI, Ekaterinburg, 2003, 320 pp.

[9] Tashlykov O. L., Sesekin A. N., Scheklein S. E., Chentsov A. G., “Razrabotka optimalnykh algoritmov vyvoda AES iz ekspluatatsii s ispolzovaniem metodov matematicheskogo modelirovaniya”, Izv. vuzov. Yadernaya energetika, 2009, no. 2, 115–120

[10] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Ekstremalnaya zadacha marshrutizatsii peremeschenii s ogranicheniyami i vnutrennimi poteryami”, Izv. vuzov. Matematika, 2010, no. 6, 64–81 | MR | Zbl

[11] Chentsov A. G., Ekstremalnye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii, RKhD, Moskva–Izhevsk, 2008, 238 pp.

[12] Sesekin A. N., Chentsov A. A., Chentsov A. G., “Obobschennaya zadacha kurera s funktsiei zatrat, zavisyaschei ot spiska zadanii”, Izvestiya RAN. Teoriya i sistemy upravleniya, 2010, no. 2, 68–77 | MR

[13] Chentsov A. G., “Metod dinamicheskogo programmirovaniya v ekstremalnykh zadachakh marshrutizatsii s ogranicheniyami”, Izvestiya RAN. Teoriya i sistemy upravleniya, 2010, no. 3, 52–66 | MR | Zbl

[14] Chentsov A. A., Chentsov A. G., “Ob odnoi zadache marshrutizatsii s vnutrennimi rabotami”, Trudy Instituta matematiki i mekhaniki UrO RAN, 18, no. 1, 2012, 298–317

[15] Chentsov A. A., Chentsov A. G., “Ob odnoi iteratsionnoi protsedure resheniya zadachi marshrutizatsii s ogranicheniyami”, Trudy Instituta matematiki i mekhaniki UrO RAN, 18, no. 3, 2012, 261–281

[16] Chentsov A. G., Chentsov P. A., “Dinamicheskoe programmirovanie v odnoi nestatsionarnoi zadache marshrutizatsii”, Izvestiya Instituta matematiki i informatiki UdGU, 2012, no. 1(39), 151–154

[17] Chentsov A. G., Chentsov P. A., “Marshrutizatsiya peremeschenii s ogranicheniyami i nestatsionarnymi funktsiyami stoimosti”, Nauchno-tekhnicheskie vedomosti SPbGPU. Informatika. Telekommunikatsii. Upravlenie (Sankt-Peterburg), 2012, no. 4, 88–93

[18] Chentsov A. G., Chentsov P. A., “Ob odnoi nestatsionarnoi zadache marshrutizatsii s ogranicheniyami”, Modelirovanie i analiz informatsionnykh sistem (Yaroslavl), 19:4 (2012), 5–24

[19] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Dinamicheskoe programmirovanie v ekstremalnykh zadachakh marshrutizatsii: obschaya teoriya i elementy parallelnoi struktury”, Parallelnye vychisleniya i zadachi upravleniya, Trudy shestoi mezhdunarodnoi konferentsii, v. 2, Moskva, 2012, 183–198

[20] Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp. | MR

[21] Dedonne Zh., Osnovy sovremennogo analiza, Mir, M., 1964, 430 pp.

[22] Varga Dzh., Optimalnoe upravlenie differentsialnymi i funktsionalnymi uravneniyami, Nauka, M., 1977, 624 pp. | MR

[23] Kormen T., Leizerson Ch., Rivest R., Algoritmy: postroenie i analiz, MTsNMO, M., 1990, 960 pp.

[24] Chentsov A. G., “Odna parallelnaya protsedura postroeniya funktsii Bellmana v obobschennoi zadache kurera s vnutrennimi rabotami”, Vestnik Yuzhno-Uralskogo gosudarstvennogo universiteta. Matematicheskoe modelirovanie i programmirovanie, 2012, no. 12, 53–76

[25] Chentsov A. G., “Odna parallelnaya protsedura postroeniya funktsii Bellmana v obobschennoi zadache kurera s vnutrennimi rabotami”, Avtomatika i telemekhanika, 2012, no. 3, 134–149