|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008年05 期
| 标题 |
| 基于改进禁忌搜索算法的车辆路径优化(30 卷) |
| 英文标题 |
| Optimization of Vehicle Routing Problem based on Improved Tabu Search Algorithm |
| 摘要 |
| 为解决车辆路径优化问题，提出改进禁忌搜索算法。首先，采用车辆—需求分配结构，将整个车辆路径问题分解成若干子问题，然后用禁忌搜索算法求解每个子问题，最后从所有子问题的最优解中选取全局最优解，并通过具有代表性的算例试验和分析。仿真试验结果表明，该算法拓展了搜 |
| 作者 |
| 新闻作者:李 松，李瑞彩，刘 兴 |
| 关键字 |
