摘要
车辆路径问题是一个NP-难问题,将该问题描述成为一个多目标最优化问题,并为之提出了一种双目标遗传算法来解决该问题.在算法中设计了一种新的构造非支配集的方法,改进了杂交算子,混合了局部爬山法.实验结果表明该算法是求解车辆路径问题的一种高效的算法.
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.
出处
《湖南工程学院学报（自然科学版）》
2006年第2期49-51,共3页
Journal of Hunan Institute of Engineering(Natural Science Edition)
关键词
车辆路径
遗传算法
多目标最优化
vehicle routing problem
genetic algorithm
multi - objective optimization
