| 混合超启发式法求解大规模VRP的优化研究 |
| |
| 引用本文： | 杜玲玲.混合超启发式法求解大规模VRP的优化研究[J].华东交通大学学报,2011,28(1):62-67. |
| |
| 作者姓名： | 杜玲玲 |
| |
| 作者单位： | 华东交通大学信息工程学院,江西,南昌,330013 |
| |
| 基金项目： | 湖北省自然科学基金项目 |
| |
| 摘 要： | 车辆路径是一类NP(non-deteministic polynomial)完全问题,研究解决车辆路径问题的高质量启发式算法有着重要理论价值和现实意义.提出一种将最近邻搜索法和禁忌搜索法优势相结合的混合超启发式算法,用来解决带容量约束的车辆路径问题.先利用最近邻搜索法构建初步路线,再利用禁忌搜索法对内部线路和互跨线路进...
|
| 关 键 词： | 大规模车辆路径问题 容量约束 最近邻搜索 禁忌搜索 混合启发式算法 |
Hybrid Heuristic Algorithm for the Large-scale VRP Optimization Problem |
| |
| Du Lingling.Hybrid Heuristic Algorithm for the Large-scale VRP Optimization Problem[J].Journal of East China Jiaotong University,2011,28(1):62-67. |
| |
| Authors: | Du Lingling |
| |
| Institution: | Du Lingling(School of Information Engineering,East China Jiaotong University,Nanchang 330013,China) |
| |
| Abstract: | Vehicle routing is a NP-complete problem.It is of theoretical and practical significance to study good quality heuristic algorithm for solving the vehicle routing problem.In order to solve the vehicle routing problem with capacity constraint,the paper presents a new and effective hybrid metaheuristic algorithm which combines the strengths of the well-known nearest neighbor search and tabu search.Nearest neighbor search is used to construct initial routes in the first stage,and then tabu search is utilized to optimize the intra-route and the inter-route in the second stage.The computational experiments are carried out on a standard benchmark and a real dataset with 6772 tobacco customers.The results demonstrate that the suggested method is highly competitive in reducing the total distance.It provides a new idea to solve the large scale vehicle routing problem. |
| |
| Keywords: | large-scale vehicle routing problem capacity constraint nearest neighbor search tabu search hybrid heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
