时变环境下选址问题的一个启发式算法

配送中心选址作为物流管理中的一个重要研究问题受到广泛重视。然而,文献中所涉及的选址模型大都是静态的,即沿一条路径行进时所需的成本(或时间)是与出发时间无关的函数。但在实际生活中,它往往是会随时间的变化而变化的,这类问题被称为时变环境下的选址问题。文中讨论了时变环境下的单配送中心到多个零售点带容量约束的选址问题。由于该问题是NP-完备的,我们给出了一个启发式算法。

A heuristic algorithm for location problem in a time-varying network

The location problem is an important research in the logistic field.Most papers mainly discuss about static models,which means time is irrelevant to transportation cost.Actually,costs vary with time.This is defined as location problem in a time-varying network.This paper is aimed to find appropriate DC location with capacity constraint.Because of NP property,we will propose an heuristic algorithm to solve the problem.