| 奔德斯分解法与分支定界法在物流网络设计中的对比研究 |
| |
| 引用本文： | 张毅华,陈森发.奔德斯分解法与分支定界法在物流网络设计中的对比研究[J].物流技术,2008,27(9). |
| |
| 作者姓名： | 张毅华 陈森发 |
| |
| 作者单位： | 1. 东南大学,经济管理学院,江苏,南京,210096;河海大学,江苏,南京,210098
2. 东南大学,经济管理学院,江苏,南京,210096 |
| |
| 摘 要： | 考虑一种需求确定、有容量、给定周期的物流网络设计问题,提出了一种新的物流网络设计模型。分别采用了分支定界法和奔德斯分解法求解该模型,并引入了LP松弛来改进两种算法。最后,选取了一组数据进行了计算实验。
|
| 关 键 词： | 奔德斯分解 分支定界法 物流 网络设计 |
Comparing Research on Benders Decomposition and Branch-and-bound in Logistics Network Design |
| |
| ZHANG Yi-hua,CHEN Sen-fa.Comparing Research on Benders Decomposition and Branch-and-bound in Logistics Network Design[J].Logistics Technology,2008,27(9). |
| |
| Authors: | ZHANG Yi-hua CHEN Sen-fa |
| |
| Abstract: | 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. |
| |
| Keywords: | Benders decomposition Branch-and bound logistics network design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
