摘要
自2003年至今,在应急指挥系统统一部署下,北京已经初步形成由应急储备、应急投放、应急加工三个环节构成的应急流程体系。本文主要提出了优化北京市粮食应急投放网点位置的算法。本文借鉴经典的K-Means算法的算法思路,在建立合理的数学模型的基础上,对模型进行迭代求解,达到了快速收敛的目的。本文同时对可能的应用情况进行了分析,并对算法的收敛性进行了证明。
since 2003, under the unified deployment of emergency command system, Beijing has formed emergency procedure system from contingency reserve, emergency release, constitute the three aspects of emergency process- ing. This paper presents the optimization of Beijing city food emergency delivery outlets location algorithm. Based on the algorithm of classical K - Means algorithm, the mathematical model is established on the reasonable, itera- tion was used to solve the model, to achieve a rapid convergence to. This paper also analyses the application poten- tial, and the convergence of the algorithm is proved.
出处
《北京财贸职业学院学报》
2013年第4期33-35,共3页
Journal of Beijing College of Finance and Commerce
关键词
应急投放网点
优化
K—Means聚类
迭代算法
emergency distribution network
optimization
K-Means clustering
iterative algorithm