| dc.contributor.author | Wijesiriwardana, R. | |
| dc.contributor.author | Silva, GTF | |
| dc.date.accessioned | 2018-05-31T13:37:16Z | |
| dc.date.available | 2018-05-31T13:37:16Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | http://ir.kdu.ac.lk/handle/345/1519 | |
| dc.description | Article full-text | en_US |
| dc.description.abstract | During disasters such as natural disasters, fires, wars, industrial accidents or viral outbreaks, it is important to guide the people to safer zones from hazardous zones. Usually, the trapped people are guided through safer routes towards safer zones via evacuation paths planned maps. This paper discusses an algorithm based on graph theory and dynamic programming capable of selecting optimum paths (groups of links) solution from multiple zones to safer zones during a disaster for unconstrained traffic flows. | en_US |
| dc.language.iso | en | en_US |
| dc.subject | Dynamic Programming | en_US |
| dc.subject | Graph Theory | en_US |
| dc.subject | Dijkstra's Algorithm and Evacuation | en_US |
| dc.title | An Unconstrained Traffic Flow Paths Solution for Evacuating from Multiple Regions to Safer Regions Using Graph Theory and Dynamic Programming | en_US |
| dc.type | Article Full Text | en_US |
| dcterms.bibliographicCitation | R Wijesiriwardana. (2014). An Unconstrained Traffic Flow Paths Solution for Evacuating from Multiple Regions to Safer Regions Using Graph Theory and Dynamic Programming. In International research Conference Proceedings:Engineering (pp. 80�84). Retrieved from http://ir.kdu.ac.lk/handle/345/1519%09 | |
| dc.identifier.journal | KDU IRC | en_US |
| dc.identifier.issue | Engineering | en_US |
| dc.identifier.pgnos | 80-84 | en_US |
