Modeling and Assessing Evacuation Route Plans by Resorting to the P-graph Framework

A Look at Algorithm BEPtoPNST

“…Despite the computational cost of solving a BEP as a PNS T problem (see equation ( 11)), the latter can be solved by resorting to the P-graph method which exploits the combinatorial nature of a BEP. Unlike other approaches, such as Hoppe and Tardos or algorithms CCRP and SSEP [14], the P-graph method provides not only the optimal solution (best evacuation route as a function of egress time), but also the best n suboptimal solutions [19]. In addition, the P-graph method can also model multiple starting locations and safety points, a feature not supported in SSEP [14].…”

“…Moreover, when these technologies, at most, generate a single solution to the problem of evacuation routes [16][17][18]. For this reason, this work analyzes the complexity, in terms of execution time, of algorithm BEPtoPNS T [19][20][21][22][23][24] with the aim to advance in the development of computational strategies that allow efficient planning of evacuation routes. The novel algorithm BEPtoPNS T allows not only to generate the optimal evacuation plan, but also sub-optimal plans [19][20][21][22][23][24], which uses a graph-theoretical approach based on P-graphs (process graphs) [25][26][27][28][29][30][31].…”

“…For this reason, this work analyzes the complexity, in terms of execution time, of algorithm BEPtoPNS T [19][20][21][22][23][24] with the aim to advance in the development of computational strategies that allow efficient planning of evacuation routes. The novel algorithm BEPtoPNS T allows not only to generate the optimal evacuation plan, but also sub-optimal plans [19][20][21][22][23][24], which uses a graph-theoretical approach based on P-graphs (process graphs) [25][26][27][28][29][30][31]. In what follows, the methods used are described, algorithm BEPtoPNS T is analyzed asymptotically, and finally, conclusions are drawn.…”