用遗传算法求解分组旅行推销员问题

Genetic Algorithm for TSP

在遗传算法能够有效解决TSP问题[3][4]的基础上,根据遗传算法———通过搜索大规模,多样化的种群,在种群间交换个体所携带的遗传信息,保留种群中个体的优越遗传信息———的思想,设计了求解分组TSP问题的遗传算法。算法中染色体表示、评价函数的构造、杂交变异算子的设计经过实例计算的检验被证明较为可靠;算法运算速度快,容易获得有效解。

In this paper, we design new operators of Genetic Algorithm (GA) to solve multi-group TSP by searching the various population with huge size, exchanging information between genetics and keeping the relatively outstanding genetics on the basis of solving TSP by GA. We give the principle and methods to solve multi-group TSP. Computer simulated experiment shows that the calculation complexity of GA is small and the relatively perfect solution can be found easily by GA.