时间限定条件下突发事故资源调度方案

Information-retrieval resource dispatch programming for emergency incidents under time constraints

面对数量较多需要及时处理的突发事故,为了满足最短应急时间限制,最低应急资源数和最少的出救点等目标,在事故应急方案选择时给出一个反映决策者对时间和费用偏好的折中方案十分必要。从实际应用出发,运用模糊优化方法研究时间与资源限制条件下的多出救点组合模型求解问题。给出了限制期条件下,应急时间最短的资源调度方法以及限制期条件下出救点数目最少的应急模型,从理论上证明了模型求解方法的正确性。在给定限制期条件下,救援网络中最优路线的求解,即通过分析得出超时风险最小的出救路径,并求出了应急路径的可信度。通过算例说明该计算方法的具体应用,为突发事故处理资源调度的智能化提供参考。

The paper is aimed at introducing a new way for programming information-retrieval resource dispatch in case of emergency incidents under deadline cortstraints. To solve the problem, we have brought about two approaches, one fuzzy solution to reflecting the preference of minimum emergency time and the other to reducing the number of recourse demands to the least. If not, it would be impossible to focus all the dispatch work in the deadline limit. In doing so, it is necessary to pick up one information-recourse dispatch program that may affect both the time reliability factor and the would-be-damage cost factor for the program-ordering. The model for the time reliability factor is to reduce the retrieval depots to the minimum by a given deadline whereas the model for reducing the number of depots to the minimum is to produce instant or quickest response to the incident occurrence so as to give out the proof of the algorithm for the two models. The above two models are expected to produce the shortest approaches to the problem in a information-retrieval network by a given deadline, during which retrieval route can be searched and found out at running the least risk of time limit exceeding. And, finally, calculation, analysis and prediction can be done concerning the case incident under study. For the above features, the programming model can be entitled as an intelligent emergency incident information resource-retrieving programming method for its marvelous features.