检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江工商大学信息学院,杭州310018 [2]山东大学管理学院,济南250100 [3]同济大学经济管理学院,上海200092
出 处:《系统工程理论与实践》2011年第3期488-495,共8页Systems Engineering-Theory & Practice
基 金:国家自然科学基金(71071035);上海市重点学科建设资助项目(B210);教育部人文社会科学项目(06JA630018)
摘 要:灾害事故的应急资源调度是减少生命财产损失的有效手段.针对灾害链中多资源应急调度问题,建立了多资源多受灾点应急调度模型,设计了基于图论中网络优化和线性规划优化思想的启发式算法,并分析了算法复杂性.该算法根据应急资源在原生灾害和次生灾害中的需求对资源进行分类,对灾害链中都需要的公共应急资源,通过对模型线性松弛解的修正,降低问题的复杂性,减少算法的计算时间;而对原生或次生灾害中需要的应急资源,运用领域搜索方法寻找出救点,得到满意的资源调度方案.最后通过算例验证了算法的有效性和可行性,表明算法适合较大规模的计算,并能满足应用中的实时性要求.Emergency resource scheduling of disasters and accidents is an effective means to reduce the loss of lives and property. This paper considers the multi-resource emergency scheduling problem in disaster chain. After the multi-resource and multi-disaster-place scheduling model is proposed, a novel heuristic algorithm is given based on~ network optimization in graph theory and linear programming optimization. The computational complexity of the algorithm is also analyzed. This algorithm divides the resources into different categories according to emergency resource demand in original and secondary disasters. For common emergency resources both disasters demand in disaster chain, this algorithm reduces the complexity and computation time of the problem by improving the linear relaxation solution of the model. For emergency resources the original or secondary disasters demand, this algorithm finds depots by local search method. Therefore the satisfactory resource scheduling solution is obtained. Finally, a numerical example is presented to show the effectiveness and feasibility of this algorithm. The algorithm is suitable for large-scale problems and meets the real-time requirement.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222