摘要
针对所有旅行商路径总和最小为优化标准的多旅行商一类问题,用遗传算法优化,并提出了矩阵解码方法。对距离非对称的多旅行商问题的实例进行了仿真,并对不同交叉算子性能进行了比较。结果表明,该算法是有效的,适用于距离对称和非对称的多旅行商问题求解。
In order to solve MTSP（ multiple traveling salesman problem） that employed total-path-shortest as the evaluating rule, this paper used genetic algorithm to optimize it and proposed decoding method with matrix. Simulated asymmetric multiple traveling salesman problems using the different crossover operators. The results suggest that this method is efficient. It is fit for solving symmetric and asymmetric multiple traveling salesman problems.
出处
《计算机应用研究》
CSCD
北大核心
2009年第5期1726-1728,1732,共4页
Application Research of Computers
关键词
遗传算法
多旅行商问题
优化
解码方法
genetic algorithm
multiple traveling salesman problem
optimization
decoding method
