TASK`S SOLUTION OF THE OPTIMAL ROUTE OF EMERCOM DIVISION`S FORCES AND RESOURCES TO INCIDENTS OCCURRENCE PLACE BY THE DIJKSTRA ALGORITHM

Buinevich M V; Vostrykh A V; Shurakova D G; Anashechkin A D

doi:doi:

Home / Journals / Problems of risk management in the technosphere / Volume 2018 Issue 3 / TASK`S SOLUTION OF THE OPTIMAL ROUTE OF EMERCOM DIVISION`S FORCES AND RESOURCES TO INCIDENTS OCCURRENCE PLACE BY THE DIJKSTRA ALGORITHM

TASK`S SOLUTION OF THE OPTIMAL ROUTE OF EMERCOM DIVISION`S FORCES AND RESOURCES TO INCIDENTS OCCURRENCE PLACE BY THE DIJKSTRA ALGORITHM

Submit manuscript

To cite

Citations:

TASK`S SOLUTION OF THE OPTIMAL ROUTE OF EMERCOM DIVISION`S FORCES AND RESOURCES TO INCIDENTS OCCURRENCE PLACE BY THE DIJKSTRA ALGORITHM

Journal: PROBLEMS OF RISK MANAGEMENT IN THE TECHNOSPHERE Volume 2018 № 3 , 2018

Rubrics: RISK REDUCTION AND ELIMINATION OF CONSEQUENCES OF EMERGENCY SITUATIONS. ENSURING SAFETY IN CASE OF EMERGENCY

Buinevich M V ¹

Vostrykh A V ²

Shurakova D G ³

Anashechkin A D ⁴

Author and publication information

Authors:

1. Saint-Petersburg university of State fire service of EMERCOM of Russia

2. Saint-Petersburg university of State fire service of EMERCOM of Russia

3. Saint-Petersburg university of State fire service of EMERCOM of Russia

4. Saint-Petersburg university of State fire service of EMERCOM of Russia

Type:

Article

Pages:

from 68 to 79

Status:

Published

Received:

12.09.2018

Accepted:

20.09.2018

Published:

25.09.2018

Language:

Russian

Keywords:

forces and resources, EMERCOM divisions, incidents occurrence place, optimal route, Dijkstra algorithm, electronic maps

Abstract and keywords

Abstract (English):
The tasks relevance of choosing the optimal route for following the forces and resources of EMERCOM divisions to the incidents occurrence place is shown. As a tool for solution, it is proposed to use electronic maps and the Dijkstra algorithm. Iterative work was performed taking into account the problematic sections of the Kostroma roads is done as a real example. The interface of the author's program for constructing the optimal route is given.

Keywords:
forces and resources, EMERCOM divisions, incidents occurrence place, optimal route, Dijkstra algorithm, electronic maps

References

1. MChS Rossii. Razdel: Chrezvychaynye situacii. Statistika chrezvychaynyh situaciy za 2003-2018 gg. URL: http://www.mchs.gov.ru/activities/stats/CHrezvichajnie_situacii (data obrascheniya: 08.04.2018).

2. Buynevich M.V., Vostryh A.V., Shurakova D.G. Dvuhurovnevaya klasterizaciya suboptimal'nyh zon prikrytiya goroda Kostroma podrazdeleniyami MChS Rossii pri vozniknovenii proisshestviy // Nauch.-analit. zhurn. «Vestnik S.-Peterb. un-ta GPS MChS Rossii». 2017. № 3. S. 121-127.

3. Tehnicheskiy reglament o trebovaniyah pozharnoy bezopasnosti: Feder. zakon Ros. Federacii ot 22 iyulya 2008 g. № 123-FZ. Dostup iz sprav.-pravovoy sistemy «Konsul'tantPlyus».

4. Ob utverzhdenii Boevogo ustava podrazdeleniy pozharnoy ohrany, opredelyayuschego poryadok organizacii tusheniya pozharov i provedeniya avariyno-spasatel'nyh rabot: Prikaz MChS Rossii ot 16 okt. 2017 g. № 444. Dostup iz sprav.-pravovoy sistemy «Konsul'tantPlyus».

5. Ob utverzhdenii Polozheniya o pozharno-spasatel'nyh garnizonah: Prikaz MChS Rossii ot 25 okt. 2017 g. № 467. Dostup iz inform.-pravovogo portala «Garant».

6. Vostryh A.V., Shurakova D.G. Komponenty special'noy informacionnoy tehnologii postroeniya optimal'nyh marshrutov // Aktual'nye problemy infotelekommunikaciy v nauke i obrazovanii (APINO-2018): sb. nauch. statey VII Mezhdunar. nauch.-tehn. i nauch.-metod. konf. 2018. T. 2. S. 213-218.

7. Levitin A.V. Algoritmy. Vvedenie v razrabotku i analiz. M.: Vil'yams, 2006. 576 s.

8. Dakett Dzh. Javascript i jQuery. Interaktivnaya veb-razrabotka. M.: Eksmo, 2017. 640 s.

9. Dakett Dzh.HTML i CSS. Razrabotka i dizayn veb-saytov. M.: Eksmo, 2013. 480 s.

Submit manuscript

To cite

Citations:

Confirmation

Регистрация