| 一种求解车辆路径问题的双目标遗传算法 |
| |
| 引用本文： | 赵瑛琪.一种求解车辆路径问题的双目标遗传算法[J].湖南工程学院学报(自然科学版),2006,16(2):49-51. |
| |
| 作者姓名： | 赵瑛琪 |
| |
| 作者单位： | 湖南城建职业技术学院,信息工程系,湖南,湘潭,411101 |
| |
| 摘 要： | 车辆路径问题是一个NP-难问题,将该问题描述成为一个多目标最优化问题,并为之提出了一种双目标遗传算法来解决该问题.在算法中设计了一种新的构造非支配集的方法,改进了杂交算子,混合了局部爬山法.实验结果表明该算法是求解车辆路径问题的一种高效的算法.
|
| 关 键 词： | 车辆路径 遗传算法 多目标最优化 |
| 文章编号： | 1671-119X(2006)02-0049-03 |
| 收稿时间： | 12 6 2005 12:00AM |
| 修稿时间： | 2005年12月6日 |
A Biobjective Genetic Algorithm for Vehicle Routing Problem |
| |
| ZHAO Ying-qi.A Biobjective Genetic Algorithm for Vehicle Routing Problem[J].Journal of Hunan Institute of Engineering(Natural Science Edition),2006,16(2):49-51. |
| |
| Authors: | ZHAO Ying-qi |
| |
| Institution: | Hunan Urban Construction College, Xiangtan 411101, China |
| |
| Abstract: | The Vehicle Routing Problem(VRP) is NP-hard.The author describes VRP as a multi-objective optimization problem and presents a biobjective genetic algorithm to solve this problem.A new method is designed to construct non-dominated set.An improved crossover operator and a hill-climbing method are applied.The experimental results demonstrate that this algorithm is very efficient for VRP. |
| |
| Keywords: | vehicle routing problem genetic algorithm multi-objective optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
