摘要
考虑一种需求确定、有容量、给定周期的物流网络设计问题,提出了一种新的物流网络设计模型。分别采用了分支定界法和奔德斯分解法求解该模型,并引入了LP松弛来改进两种算法。最后,选取了一组数据进行了计算实验。
Considering the logistics network design with determined demand, capacity and given period, the paper puts forward a new logistics network design model, solves the model respectively with branch-and-bound method and Benders decomposition method and introduces the LP relaxation to improve the two algorithms. The result of experiment shows that Benders decomposition is somewhat more advantageous in the more difficult problems.
出处
《物流技术》
2008年第9期54-57,104,共5页
Logistics Technology
关键词
奔德斯分解
分支定界法
物流
网络设计
Benders decomposition
Branch-and bound
logistics
network design
