摘要
为解决应急管理系统中的应急设施最优选址问题,提出在覆盖所有需求点前提下以应急设施数目最少为目标的选址模型。从网络选址的角度出发,基于集合覆盖优化应急设施在网络上的布局,使其决策空间不再局限于离散点集。针对决策空间连续性给问题求解带来的困难,利用候选点集算法通过求解可能的有效路径集将连续解空间离散化,极大地缩小问题的解空间,将此网络设计问题转换为0-1整数规划问题进行求解。将候选点集算法应用于实例分析中,求得该区应急服务设施数量及其位置。
To reasonably select locations of emergency facilities,a model aimed at minimizing the number of emergency facilities was built under the presuppositon of covering all demand points.From the network location point of view,distribution of emergency facilities on network was optimized based on set covering so that decision space was no longer limited to discrete set of points.For the difficulties caused by the continuity of the decision space to solve the problem,The candidate sites algorithm was used to discretize the continuous solution space by solving possible effective path set,the solution space was greatly reduced and network design problems were converted into the 0-1 integer programming problem.The results show that by means of solving 0-1 integer programming problem can achieve distribution optimization of emergency facilitie on network.
出处
《中国安全科学学报》
CAS
CSCD
北大核心
2012年第9期172-176,共5页
China Safety Science Journal
基金
四川省科技支撑计划资助项目(2011FZ0050)
