Abstract and keywords
Abstract (English):
The article is devoted to the development of a methodology aimed at minimizing damage caused by flooding. The authors set themselves the task of rational distribution of work volumes between threatened areas based on the branch-and-bound method. The developed methodology for distributing the volumes of operational measures to protect the population and territories from flooding under conditions of time and resource constraints during the implementation of protective measures will allow for a rational distribution of available forces and resources among the work areas. The proposed approach aims to improve the efficiency of work carried out by the territorial subsystem of the unified state system for emergency prevention and response. The work will be in demand among representatives of the executive bodies of the constituent entities of the Russian Federation, as well as those responsible for developing and implementing measures to prevent and eliminate the consequences of floods.

Keywords:
flooding, protection of population and territories, emergency, theory of schedules, operational measures
Text
Text (PDF): Read Download
References

1. Masshtaby i opasnost' navodnenij v regionah Rossii / V.V. Razumov [i dr.]; pod red. V.V. Razumova. M.: FGBU VNII GOCHS. 2018. 363 s.

2. O podhode k minimizacii material'nogo riska pri chrezvychajnyh situaciyah (pavodkah), vyzvannyh zatornymi yavleniyami / E.V. Ivanov [i dr.] // Sibirskij pozharno-spasatel'nyj vestnik. 2022. № 4 (27). S. 92–97. DOI:https://doi.org/10.34987/vestnik.sibpsa.2022.44.95.015. EDN LFMECR.

3. O problemnoj situacii planirovaniya meropriyatij po umen'sheniyu ushcherba i reagirovaniyu na chrezvychajnye situacii v pavodkoopasnyj period na territorii sub"ekta Rossijskoj Federacii / A.V. Dmitriev [i dr.] // Tekhnosfernaya bezopasnost'. 2024. № 4 (45). S. 132–138.

4. Postanovka nauchnoj zadachi minimizacii ushcherba pri zatopleniyah / E.V. Ivanov [i dr.] // Nauchnye i obrazovatel'nye problemy grazhdanskoj zashchity. 2025. № 1 (64). S. 42–50. EDN JMRJBM.

5. Zak Yu.A. Prikladnye zadachi teorii raspisanij i marshrutizacii perevozok. M.: Knizhnyj dom «LIBROKOM», 2018. 394 s.

6. Land, Ailsa H., Alison G. Doig an automatic method for solving discrete programming problems. 2009. P. 105–132. DOI:https://doi.org/10.1007/978-3-540-68279-0_5.

7. Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization / S. Xu [et al.] // Proceedings of the AAAI Conference on Artificial Intelligence. 2020. № 34 (02). P. 1684–1691. DOI:https://doi.org/10.1609/aaai.v34i02.5531.

8. Korte B., Vygen J. Combinatorial optimization // Theory and Algorithms. Berlin: Springer-Verlag, 2018. P. 698.

9. Publication, I. JR AS ET. Optimization Techniques to Solve Travelling Salesman Problem Using Machine Learning Algorithms // International Journal for Research in Applied Science & Engineering Technology (IJRASET). 2022. Vol. 10. № I. P. 274–279.

10. Mel'nikov B.F., Mel'nikova E.A. O klassicheskoj versii metoda vetvej i granic // Komp'yuternye instrumenty v obrazovanii. 2021. № 1. S. 21–44. DOIhttps://doi.org/10.32603/2071-2340-2021-1-21-45. EDN GSXTQL.

11. Yacucenko V.N., Mazanik A.I. Nauchno-metodicheskij apparat racional'nogo raspredeleniya operativnyh grupp dlya provedeniya monitoringa ledovoj obstanovki // Nauchno-analiticheskij zhurnal «Vestnik Sankt-Peterburgskogo universiteta Gosudarstvennoj protivopozharnoj sluzhby MCHS Rossii». 2022. № 3. S. 50–57. EDN MTQBZN.

12. Dorigo M., Stützle T. Ant Colony Optimization: Overview and Recent Advances // Handbook of Metaheuristics, Springer Nature. 2018. P. 311–351. DOI:https://doi.org/10.1007/978-3-319-91086-4_10.

13. Tkachenko P.N., Tkachenko Yu.A., Polevoy E.V. Podhod k obosnovaniyu meropriyatiy po preduprezhdeniyu ledovyh zatorov // Tehnologii grazhdanskoy bezopasnosti. 2024. T. 21. № 3 (81). S. 26–35.

14. Tkachenko P.N., Tkachenko Yu.A., Polevoj E.V. Podhod k obosnovaniyu meropriyatij po preduprezhdeniyu ledovyh zatorov // Tekhnologii grazhdanskoj bezopasnosti. 2024. T. 21. № 3 (81). S. 26–35.

Login or Create
* Forgot password?