USING OF GRAPH THEORY FOR SUMMONING FLOOD OF MEMBERS OF THE COMMISSION
Keywords:
TSP problem, heuristic algorithm, Little algorithmAbstract
The article deals with the coupling paths for ensuring accessibility chairmen and members of the commissions on flood alert issued by the Czech Hydrometeorological Institute and the subsequent announcement of the first degree flood flow, which cannot use the services of the mobile operator whether due to human error or loss of signal. It is used in the role of traveling salesman, exact method of solution Little algorithm and for comparing the quality of solutions heuristic by heuristic algorithm.
Downloads
References
Litavka, Praha: ČVUT v Praze Fakulta dopravní, diplomová práce, 2013
(2) MOCKOVÁ, D. Základy teorie dopravy, úlohy, Praha: Vydavatelství ČVUT
v Praze, 2007. 96 s., ISBN 978-80-01-03791-1
(3) VOLEK, J., LINDA, B. Teorie grafů – aplikace v dopravě a veřejné správě,
Pardubice: Univerzita Pardubice, 2012, 192 s., ISBN 978-80-7395-225-9
(4) BAUDYŠ, K. - JANOŠ, V. Hierarchické plánování v regionální dopravě. In
Telematika pro regionální dopravu 2007. Brno: KPM Consult, 2007, ISBN 978-80-
239-9273-1.
(5) PROCHÁZKOVÁ, D. - LÁNSKÁ, M. - MOCKOVÁ, D. Impacts of The Failure of
Selected Transport Infrastructure Elements. Perner's Contacts. 2012, vol. 7, no. 4,
p. 126-137. ISSN 1801-674X.
(6)MĚSTO ZDICE (PAPEŽ, J.) Povodňový plán Města Zdice, Koordinace, Otovice,
2004
(7) http://maps.google.cz/.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Denisa Mocková
This work is licensed under a Creative Commons Attribution 4.0 International License.