Efficient computation of evacuation routes on a three-dimensional geometric network

•We define a real-time emergency evacuation problem that seeks for rapid evacuation routes in buildings.•We formulate the stochastic routing problem as a non-linear routing problem subject to node-wise constraints.•We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorith...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & industrial engineering Vol. 76; pp. 231 - 242
Main Authors:	Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.10.2014 Pergamon Press Inc
Subjects:	Algorithms Approximation Computer networks Construction Dynamic programming Evacuation Evacuations & rescues Fully polynomial-time approximately feasible scheme Fully polynomial-time approximation scheme Geometry Mathematical models Mathematical problems Networks No-notice building evacuation Random variables Real time Real-time emergency routing Route optimization Routing (telecommunications) Studies Three dimensional Fully polynomial-time approximation scheme Real-time emergency routing Dynamic programming Fully polynomial-time approximately feasible scheme No-notice building evacuation
ISSN:	0360-8352, 1879-0550
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!