| 大规模车辆路径问题的启发式算法 |
| |
| 引用本文： | 邵宏,刘兴. 大规模车辆路径问题的启发式算法[J]. 中国农机化, 2008, 0(5) |
| |
| 作者姓名： | 邵宏 刘兴 |
| |
| 作者单位： | 1. 天津大学管理学院,300072,天津市;军事交通学院,300161,天津
2. 军事交通学院,300161,天津 |
| |
| 摘 要： | 提出了基于SWEEP顾客分组和禁忌搜索算法的综合启发式算法.算法采用顾客分区的方法将大规模问题简化为可并行计算的若干小规模问题,降低了问题复杂度;采用相邻区域综合优化技术弥补了分组可能将算法带入局部搜索的缺陷,提高了算法的全局搜索能力.计算结果表明该算法是一种速度快、优化效果好的启发式算法.
|
| 关 键 词： | 物流 车辆路径问题 启发式算法 禁忌搜索 |
A Heuristics for Vehicle Routing Problem of Large -scale Logistics Systems |
| |
| SHAO Hong,LIU Xing. A Heuristics for Vehicle Routing Problem of Large -scale Logistics Systems[J]. Chinese Agricul Tural Mechanization, 2008, 0(5) |
| |
| Authors: | SHAO Hong LIU Xing |
| |
| Affiliation: | SHAO Hong1,2,LIU Xing2 |
| |
| Abstract: | A hybrid heuristics based on sweep clustering and tabu search (STH) is proposed for the large-scale vehicle routing problem (LSVRP). In the STH, all customers being clustered into several zones, within each of which a vehicle routing is constructed and optimized, then every two adjacent zones are combined as a whole to optimise. The clustering simplifies the large-scale problem into several small-scale problems that can be computed respectively; the combination of every two adjacent zones improves the global search capability of the heuristic. Computation results show the heuristics is a very effective heuristics for the LSVRP. |
| |
| Keywords: | logistics vehicle routing problem (VRP) heuristics tabu search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
