Abstract: Under the restrictions of safe distance and supplied distance, a mathematical model is given for solving the problem of the optimal location, and an algorithm is shown, which can not only solve the problems about the number and the location of the warehouse, but also determine limit responsibility of every warehouse. Compared with other existing algorithms, this algorithm is simpler and more efficient, and the complexity of the algorithm is[O(n3)].

Key words: safe distance, supplied distance, optimal location, network, complexity of the algorithm

摘要： 研究了在同时具有安全距离和供货距离的限制条件下，至少要建几个仓库，建在何处，每个仓库各负责为哪些货物需求点提供货物的最优选址问题，建立了该最优选址问题的数学模型，给出了一种使用简便，算法复杂度为[O(n3)]的优化算法。

关键词: 安全距离, 供货距离, 最优选址, 网络, 算法复杂度