基于K-Means聚类算法的应急物流中心选址

Location of Emergency Logistics Center Based on K-Means Clustering Algorithm

摘要: 应急物流中心的选址结果决定了救援运输效率的上限。本文主要讨论的是药品储备集装箱的选址问题。在美国波多黎各飓风袭击的背景下，选取了一系列约束条件，建立对应的数学模型，并通过K-means聚类算法求解，最后比较其与模糊C聚类算法的结果。

Abstract: The location of emergency logistics center determines the upper limit of rescue and transportation efficiency. The paper mainly discusses the location of the medicine storage container. Under the background of hurricane attacking Puerto Rico, a series of constraints are selected, and the corre-sponding mathematical models are established, which are solved by K-means clustering algorithm. Finally, the results of the algorithm are compared with those of fuzzy C clustering algorithm.