对于发生频率低,影响力大的突发事件,组织与个人的应急经验将影响判断与决策。应急响应程序在突发事件的响应过程中起着指导作用,通过对多个应急预案中响应程序分析发现,一些行动措施经常按照固定次序重复出现,如果将这种组合关系规范化,并固定成为模块,响应时间将会缩短,应急机构与人员之间的协调将会改善,模块的产生为应急预案的快速调整以及应急培训提供参考方案。本文的主要目的是从多个应急响应程序中提取具有通用性与特殊性的模块,首先对多个应急响应程序叠加起来的有向总图进行了分割,通过定义的有向图相似性判断候选模块的代表性,最后以复原应急响应程序的差异性之和与模块接口之和为目标,建立数学规划模型,并设计启发式算法求解,将有向总图所有的边分配到响应程序模块。通过案例计算分析,验证所提方法可以获得所需模块,并为实现应急响应程序快速重构与功能组合提供了方法基础。
In very low-frequency,high-consequence emergency events, a group or individual's prior experience will influence judgments and decision. Emergency response procedures play a guiding role when emergency accidents happen. Through analyzing multiple emergency response procedures, it is found that some actions repeatedly work together with a sequence, if those actions can be normalizedand fixed as a module, reaction time will be reduced and coordination will be improved, the generation of emergency modular will provide a suggestion for the same type of emergency accident on adjusting and emergency training. The purpose of this paper is to extract the commonality and particularity module from multiple emergency response procedures, firstly partition the general directed graphwhich is formed by superimposing multiple emergency response procedures, and determine therepresentative of candidate module by defining the similarity of the directed graph. Finally, a mathematical programming model whose goal is to minimum the sum of procedures' difference and module's interface is built. Then, by designing the heuristic algorithm, all edges of general directed graph are distributed to response procedure modules. Through analyzing the case, it is verified that this method can obtain the module with demand, and it provides a methodological basis for rapidly reconstruction and functional combination on emergency response procedures.
[1] 袁宏永,苏国锋,李藐.论应急文本预案、数字预案与智能方案[J].中国应急管理, 2007,(4):20-23.
[2] 刘磊,池宏,邵雪焱,等.预案管理中的重构问题研究[C]. 第四届国际应急管理论坛暨中国(双法)应急管理专业委员会第五届年会,北京,2009年12月12日-13日.
[3] 蔡冠华,黎伟.美国应急预案体系研究及对我国的标准化建议[J].质量与标准,2013,(7):42-45.
[4] 田军,李莉芳,白剑,等.基于DSM的应急任务流程模块化设计研究[J].中国管理科学,2014, 22(8):100-107.
[5] 邓婕,祁明亮,池宏,等.应急预案响应程序模块化研究[J].运筹与管理, 2015, 24(5):132-143.
[6] 姜艳萍,樊治平,苏明明.应急决策方案的动态调整方法研究[J].中国管理科学,2011,19(5):104-109.
[7] 王剑,罗东.基于BDN的突发事件多主体应急决策模型研究[J].中国管理科学,2015,23(S1):316-325.
[8] 荣莉莉,杨永俊.一种基于知识供需匹配的预案应急能力评价方法[J].管理学报,2009,6(12):1643-1647.
[9] Liu lei, Chi Hong, Shao Xueyan, et al. A study on reconstruction problem in emergency plan management[C]//Proceedings of International Symposium on Emergency Management, Beijing, China,2009.
[10] GirardC,David P, PiatyszekE et al. Emergency response plan:Model-based assessment with multi-state degradation[J].Safety Science,2016,85:230-240.
[11] Turoffa M, Bañulsb V, Plotnickc L,et al.A collaborative dynamic scenario model for the interaction of critical infrastructures[J]. Futures, 2016,84(Part A):23-42.
[12] Mendonc D, Beroggi G E G, van Gent D, et al. Designing gaming simulations for the assessment of group decision support systems in emergency response[J].Safety Science, 2006,44(6):523-535.
[13] Yoon S W,Velasquez J D,Partridge B K, et al.Transportation security decision support system for emergency response:A training prototype[J].Decision Support Systems,2008, 46(1):139-148.
[14] Koutra D, Parikh A,Parikh A,et al. Algorithms for graph similarity and subgraphmatching[R].Technical Report,2011.Carnegie Mellon University.
[15] Zelinka B. On a certain distance between isomorphism classes of graphs[J].Casopis Pest. Math.,100,(4):371-373.
[16] Sobik F,Sommerfeld E. A graph theoretic approach to the characterization of classes of structured objects[J].Computers and Artificial Intelligence,1984,3:235-247.
[17] Giugno R,Shasha D.Graphgrep:A fast and universal method for querying graphs[C]//Proceedings of International Cenferenee on Pattern Recognition,Quebec City,Canada,August 11-15,2002.
[18] Jeh G,Widom J. SimRank:A measure of structural-context similarity[C]//Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, Edmonton,Alberta,Canada,July 23-26,2002.
[19] Blondel V D, Gajardo A, Heymans M, et al. A measure of similarity between graph vertices:Applications to synonym extraction and web searching[J]. SIAM Review, 2004, 46(4), 647-666.
[20] Zager L A,Verghese G C. Graph similarity scoring and matching[J]. Applied Mathematics Letters, 2008.21(1):86-94.
[21] Bayati M,Gleich D F,Saberi A, et al. Message passing algorithms for sparse networkalignment[J]. 2013,7(11):1-31.