| 求解车辆路径问题的一种遗传算法 |
| |
| 引用本文： | 林丹,丑英哲,王萍. 求解车辆路径问题的一种遗传算法[J]. 系统管理学报, 2006, 15(6): 528-533 |
| |
| 作者姓名： | 林丹 丑英哲 王萍 |
| |
| 作者单位： | 天津大学,理学院,天津,300072 |
| |
| 基金项目： | 国家自然科学基金;教育部南开天津大学刘徽应用数学中心资助项目 |
| |
| 摘 要： | 车辆路径问题(VRP)是一个典型的NP-hard问题,采用传统方法求解往往找不到满意解。在分析现有求解该问题的遗传算法的基础上,对现有的交叉算子进行了改进,并设计了基于自然数编码的遗传算法,用来求解一般的和有时间窗限制的车辆路径问题。采用文献中的实例进行了数值试验,试验结果表明该算法是有效的。
|
| 关 键 词： | 车辆路径问题 遗传算法 时间窗 部分匹配交叉 |
| 文章编号： | 1005-2542(2006)06-0528-06 |
| 修稿时间： | 2005-10-12 |
A Genetic Algorithm for the Vehicle Routing Problems |
| |
| LIN Dan,CHOU Ying-zhe,WANG Ping. A Genetic Algorithm for the Vehicle Routing Problems[J]. Systems Engineering Theory·Methodology·Applications, 2006, 15(6): 528-533 |
| |
| Authors: | LIN Dan CHOU Ying-zhe WANG Ping |
| |
| Abstract: | The vehicle routing problem is a classical NP-hard problem,and it is usually difficult for traditional methods to obtain satisfying solutions.In this paper,on the basis of analysis of the existing genetic algorithms,an improved crossover operator is presented,and a genetic algorithm for solving vehicle routing problems with and without time windows is proposed which is based on a natural number coding scheme.The performance of the proposed algorithm is evaluated in numerical simulations.The results shows the efficiency of the proposed algorithm. |
| |
| Keywords: | vehicle routing problem genetic algorithm time window partially matched crossover |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
