| 营救设备数量受限的应急疏散模型和算法 |
| |
| 引用本文： | 杨建芳,高岩.营救设备数量受限的应急疏散模型和算法[J].运筹学杂志,2014(2):77-86. |
| |
| 作者姓名： | 杨建芳 高岩 |
| |
| 作者单位： | [1]上海理工大学管理学院,上海200093 [2]杭州电子科技大学运筹与控制研究所,杭州310018 |
| |
| 基金项目： | 国家自然科学基金（Nos.11071219,11171221）,上海市科委（No.10550500800）,上海市一流学科项目（No.CTKX2012）,上海市研究生创新培育项目（No.5413303101）,浙江省自然科学基金（No.Y13A010050） |
| |
| 摘 要： | 考虑在实际中可能面临着某些救援活动，必须借助于营救设备或者依赖营救人员的引导才能得以完成．针对这种情况，给出了设备数量受限的应急疏散模型．由于目标函数是疏散时间最小化，在考虑路径容量限制时，首先通过优先饱和最短路径来确定可行路径集合，把可行路径集合中的k短路作为初始解，再以每条路径上流量与旅行时间的比值流速作为更新路径的准则，每步迭代通过保留流速较大的路径来保存当前疏散时间最小的路径集合，从而确定疏散方案．最后通过算例验证了该算法的有效性和可行性．
|
| 关 键 词： | 应急疏散 营救设备 容量限制 动态网络流 |
Emergency evacuation model and algorithm with the limited number of rescue equipments |
| |
| Authors: | YANG Jianfang GAO Yan |
| |
| Institution: | 1.Business School, University of Shanghai for Science and Technology, Shanghai 200093, China 2. Institute of Operational Research and Cybemetics, Hangzhou Dianzi University, Hangzhou 310018, China) |
| |
| Abstract: | In real evacuation mission the number of available evacuation paths there might be fewer rescue equipments than When this situation occurs, a mathematical model is given with objective function minimizing evacuation time and a k-limited flow control algorithm is designed based on flow velocity in this paper. First the feasible path sets would be calculated by sending the largest possible number of evacuees on the shortest path to the nearest destination, and k-shortest paths from it is regarded as the initial solution. Then the algorithm can be realized by updating network according to the flow velocity, in the same time, the path set with minimal evacuation time should be preserved in each iteration. Finally, a numerical example is presented to show the effectiveness and feasibility of this algorithm. |
| |
| Keywords: | emergency evacuation rescue equipments capacity constraints dynamic network flow |
| 本文献已被 维普 等数据库收录！ |
|
