High rise building evacuation route model using DIJKSTRA'S algorithm /
Evacuation of high rise building has become an issue nowadays as the modem development has increased tremendously with a very complex structure and design. The complexity and height of the building can affect the successfulness of the evacuation process, especially towards unfamiliar occupants...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Software eBook |
| Lingua: | English |
| Pubblicazione: |
2015.
|
| Soggetti: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
| LEADER | 03784pam a2200457 i 4500 | ||
|---|---|---|---|
| 001 | 100060 | ||
| 003 | UTeM | ||
| 005 | 20210104150117.0 | ||
| 007 | co ag |||||||| | ||
| 008 | 161117s2016 my ||||| |||| | | eng d | ||
| 999 | |c 100060 |d 100060 | ||
| 020 | |c gift | ||
| 040 | |a UTeM |b eng |c UTeM |e rda | ||
| 090 | 0 | 0 | |a QA76.5 |b .N37 2015 |
| 100 | 0 | |a Nor Amalina Mohd Sabri, |e author. |9 69751 | |
| 245 | 1 | 0 | |a High rise building evacuation route model using DIJKSTRA'S algorithm / |c Nor Amalina Mohd Sabri. |
| 264 | 1 | |c 2015. | |
| 300 | |a xi, 132 pages : |b colour illustrations, charts ; |c 30 cm + |e 1 computer disc (12 cm) | ||
| 336 | |a text |2 rdacontent | ||
| 336 | |a still image |2 rdacontent | ||
| 337 | |a unmediated |2 rdamedia | ||
| 338 | |a volume |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 500 | |a Accompanied by CD : CDR 13899. | ||
| 504 | |a Reference : pages 119-134. | ||
| 520 | |a Evacuation of high rise building has become an issue nowadays as the modem development has increased tremendously with a very complex structure and design. The complexity and height of the building can affect the successfulness of the evacuation process, especially towards unfamiliar occupants in the building. Generally, they only know the route taken while they enter the building. Moreover, the available evacuation map provided by the building is not showing the shortest and safest path. Subsequently, they are hard to find the optimal route to escape. Furthermore, the shortest path algorithm needed additional features to produce better result. This research aims to assist the evacuees to find the shortest path in a high rise building using a shortest path algorithm. The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. The method involves in this research starts with abst!acting the original floor plan of the high rise building into CAD format. The floor plan is an important data to be used in this study, which is to design the evacuation route of the building. However, the original floor plan is visualised into 2D layout to gather the information on nodes and weights. The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. The main algorithms involve is Dijkstra's algorithm and then an Ant Colony Optimization algorithm is used as hybrid versions of Dijkstra's algorithm. As a result, the evacuation route model is able to gain the shortest path and safest path consistently between Dijkstra's algorithms and hybrid version which is Dijkstra-Ant Colony Optimization (DACO). In conclusion, based on the results, the shortest path can be implemented into a computerized evacuation map of the high rise building which can assist evacuees in pre evacuation to fmd the shortest and safest path to evacuate. | ||
| 650 | 0 | |a Algorithms. |9 4085 | |
| 650 | 0 | |a Buildings |x Security measures. |9 21574 | |
| 710 | 2 | |a Universiti Teknikal Malaysia Melaka, |e issuing body. |9 50206 | |
| 720 | |a Associate Professor Dr. Abd Samad Hasan Basari | ||
| 790 | |a Faculty of Information and Communication Technology | ||
| 791 | |a Master of Science in Information and Communication Technology | ||
| 792 | |a 2015 | ||
| 942 | |2 lcc |c THM - A |k a | ||
| 996 | |a MITA | ||
| 997 | |a FTMK | ||
| 998 | 0 | 0 | |a zdi/160117 |
| 998 | 0 | 0 | |a mhj/091120 |
| 998 | 0 | 0 | |a mrd/040121 |
| 952 | |0 0 |1 0 |2 lcc |4 0 |6 QA00765 N37 02015 |7 0 |9 125914 |a PLHKI |b PLHKI |c 1 |d 2019-02-26 |e UTeM |g 0.00 |l 3 |o QA76.5 .N37 2015 |p 0000125615 |r 2018-06-28 |s 2018-06-28 |w 2019-02-26 |y THM - A | ||
| 952 | |0 0 |1 0 |2 lcc |4 0 |6 CDR13899 |7 0 |9 126044 |a MEDIA |b MEDIA |c 5 |d 2019-02-26 |g 0.00 |l 0 |o CDR 13899 |p 0000126265 |r 2017-02-07 |s 2017-02-07 |w 2019-02-26 |y CDR - MEA | ||