|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年03 期
| 标题 |
| 基于混合禁忌搜索算法的物流配送路径优化问题研究(29 卷) |
| 英文标题 |
| Study on Optimization of Logistics Distribution Route Based on Mixed Tabu Search Algorithm |
| 摘要 |
| 在对配送路径优化问题进行描述的基础上，建立物流配送路径优化问题的数学模型，提出了一种求解车辆路径问题的混合禁忌搜索算法。在该混合算法中，通过车辆—任务分配结构的划分将大规模问题拆分成可并行计算的若干小规模问题，减少了算法的计算时间。并通过理论分析和仿真算 |
| 作者 |
| 新闻作者:李 松，刘 兴，李瑞彩 |
| 关键字 |
