An evacuation model coupling with toxic effect for chemical industrial park

Abstract Emergency evacuation plan plays a key role for disaster management and successful evacuation. In this work, a conceptual decision support system is established and a method to determine the evacuation scope under toxicant leakage accidents is also proposed. Simultaneously, a route selection approach coupling with polluted scope is proposed based on operation mathematic analysis. The best route for evacuee at each location on toxic leakage accidents is the one along with which the heath injury is minimal. Hence, a variable based on toxic load is defined and noted as D V i − V j , which is used to quantify the toxic exposure. The universally minimal D V i − V j is taken as the optimized goal in the model. And then, one case is presented and indicates that this approach can aid the emergency managers to make the right response to the leakage accident in an efficient manner. This new method is also useful for fire risk assessment and design of chemical industrial park.

[1]  Takeo Yamada,et al.  A network flow approach to a city emergency evacuation planning , 1996, Int. J. Syst. Sci..

[2]  S Bonvicini,et al.  Hazardous materials transportation: a risk-analysis-based routing methodology. , 2000, Journal of hazardous materials.

[3]  Bin Jia,et al.  Evacuation dynamics with fire spreading based on cellular automaton , 2011 .

[4]  Dong Zhang,et al.  Study on evacuation behaviors at a T-shaped intersection by a force-driving cellular automata model , 2012 .

[5]  Weiguo Song,et al.  Staircase evacuation modeling and its comparison with an egress drill , 2009 .

[6]  Erica D. Kuligowski,et al.  Overall and local movement speeds during fire drill evacuations in buildings up to 31 stories , 2012 .

[7]  Edwin R. Galea,et al.  An agent based evacuation model utilising hybrid space discretisation , 2012 .

[8]  Gigliola Spadoni,et al.  A hazmat multi-commodity routing model satisfying risk criteria : A case study , 2008 .

[9]  Lizhong Yang,et al.  Exit dynamics of occupant evacuation in an emergency , 2006 .

[10]  Lisa Fleischer,et al.  Faster Algorithms for the Quickest Transshipment Problem , 2001, SIAM J. Optim..

[11]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[12]  Jian Ma,et al.  Experimental study on an ultra high-rise building evacuation in China , 2012 .

[13]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[14]  Michael Spearpoint,et al.  The effect of an ageing and less fit population on the ability of people to egress buildings , 2012 .

[15]  William E. Dunn,et al.  Application of a quantitative risk assessment method to emergency response planning , 2007, Comput. Oper. Res..

[16]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[17]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[18]  M. Kostreva,et al.  Time Dependency in Multiple Objective Dynamic Programming , 1993 .

[19]  Warren B. Powell,et al.  A transportation network evacuation model , 1982 .

[20]  P. Nash,et al.  A Class of Continuous Network Flow Problems , 1982, Math. Oper. Res..

[21]  Lisa Fleischer,et al.  Universally maximum flow with piecewise‐constant capacities , 2001, Networks.

[22]  W. L. Wilkinson,et al.  An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..

[23]  Michael Schreckenberg,et al.  Pedestrian and evacuation dynamics , 2002 .