摘要
就商品配送中,带有能力约束的车辆路径问题(VRP),设计了一种新的遗传算法.该算法的核心在于构建一种新的染色体编码,将VRP问题转化为m个TSP问题,并设计出新的杂交算子.算法中染色体表示、评价函数的构造、杂交变异算子的设计经过实例计算的检验被证明较为可靠,算法运算速度快,容易获得有效解.
In this paper, a new genetic algorithm is designed to solve the vehicle routing problem（VRP） with capacity restriction in commodity delivery. The core of the genetic algorithm is the new construction of chromosome code to invert VRP to m-TSP, and the novel crossover operator is designed. The result of simulated test indicates that the algorithm is reliable and easy to find the relative perfect solution.
出处
《兰州交通大学学报》
CAS
2005年第6期123-126,共4页
Journal of Lanzhou Jiaotong University
关键词
车辆路径问题
遗传算法
染色体编码
交叉算子
vehicle routing problem
genetic algorithm
chromosome code
crossover operator
