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

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