Abstract:
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.
\Bibitem{Che13}
\by A.~G.~Chentsov
\paper To question of routing of works complexes
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2013
\issue 1
\pages 59--82
\mathnet{http://mi.mathnet.ru/vuu364}
\crossref{https://doi.org/10.20537/vm130107}
Linking options:
https://www.mathnet.ru/eng/vuu364
https://www.mathnet.ru/eng/vuu/y2013/i1/p59
This publication is cited in the following 32 articles:
A. G. Chentsov, P. A. Chentsov, “Two-stage dynamic programming in the routing problem with decomposition”, Autom. Remote Control, 84:5 (2023), 609–632
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “K voprosu o primenenii minimaksnoi zadachi kommivoyazhera k problemam aviatsionnoi logistiki”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 16:3 (2023), 20–34
A. G. Chentsov, P. A. Chentsov, “Dinamicheskoe programmirovanie v zadache marshrutizatsii: dekompozitsionnyi variant”, Vestnik rossiiskikh universitetov. Matematika, 27:137 (2022), 95–124
A. G. Chentsov, P. A. Chentsov, “Ekstremalnaya dvukhetapnaya zadacha marshrutizatsii i protsedury na osnove dinamicheskogo programmirovaniya”, Tr. IMM UrO RAN, 28, no. 2, 2022, 215–248
A. G. Chentsov, A. A. Chentsov, “Dinamicheskoe programmirovanie i voprosy razreshimosti zadachi marshrutizatsii «na uzkie mesta» s resursnymi ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 32:4 (2022), 569–592
A. G. Chentsov, A. A. Chentsov, “Ob odnoi zadache marshrutizatsii, orientirovannoi na problemu demontazha radiatsionno opasnykh ob'ektov”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 15:3 (2022), 83–95
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Odna zadacha marshrutizatsii rabot v usloviyakh povyshennoi radiatsii”, Izv. IMI UdGU, 58 (2021), 94–126
A. G. Chentsov, P. A. Chentsov, “K voprosu ob optimizatsii tochki starta v zadache marshrutizatsii s ogranicheniyami”, Izv. IMI UdGU, 55 (2020), 135–154
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Ob odnoi zadache marshrutizatsii s neadditivnym agregirovaniem zatrat”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 13:1 (2020), 64–80
Alexander G. Chentsov, Pavel A. Chentsov, “On routing problem with starting point optimization”, Ural Math. J., 6:2 (2020), 44–62
A. G. Chentsov, P. A. Chentsov, “The routing problems with optimization of the starting point: dynamic programming”, Izv. IMI UdGU, 54 (2019), 102–121
A. G. Chentsov, A. A. Chentsov, “K voprosu o marshrutizatsii peremeschenii v zadache s dinamicheskimi ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 29:3 (2019), 363–381
Chentsov A.A., Chentsov A.G., Sesekin A.N., Tashlykov O.L., “Application of a Generalized Bottleneck Routing Problem to the Task of Adhering to Acceptable Doses of Radiation During the Dismantling of Radiation Hazardous Objects”, IFAC PAPERSONLINE, 52:13 (2019), 2656–2661
A. G. Chentsov, MECHANICS, RESOURCE AND DIAGNOSTICS OF MATERIALS AND STRUCTURES (MRDMS-2019): Proceedings of the 13th International Conference on Mechanics, Resource and Diagnostics of Materials and Structures, 2176, MECHANICS, RESOURCE AND DIAGNOSTICS OF MATERIALS AND STRUCTURES (MRDMS-2019): Proceedings of the 13th International Conference on Mechanics, Resource and Diagnostics of Materials and Structures, 2019, 020001
A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov, “Solving a routing problem with the aid of an independent computations scheme”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:1 (2018), 60–74
A. G. Chentsov, P. A. Chentsov, “Optimizatsiya tochki starta v zadache posledovatelnogo obkhoda megapolisov pri nalichii uslovii predshestvovaniya”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:2 (2018), 83–95
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Dinamicheskoe programmirovanie v obobschennoi zadache «na uzkie mesta» i optimizatsiya tochki starta”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:3 (2018), 348–363
A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Autom. Remote Control, 78:4 (2017), 666–681
A. G. Chentsov, A. A. Chentsov, A. M. Grigorev, “Ob odnoi zadache marshrutizatsii, modeliruyuschei peremescheniya v radiatsionnykh polyakh”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 27:4 (2017), 540–557
A. A. Chentsov, A. G. Chentsov, “Obobschennaya model kurera s dopolnitelnymi ogranicheniyami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 9:1 (2016), 46–58
Citation in format AMSBIB
Contact us: