摘要
TSP问题是一个经典的NP难度的组合优化问题,遗传算法是求解TSP问题的有效方法之一。利用交换启发交叉算子实现局部搜索加快算法的收敛速度和利用变换变异算子维持群体的多样性防止算法早熟收敛,给出了一种求解TSP问题的遗传算法。仿真实验结果表明了该算法的有效性和可行性。
TSP(Traveling Salesman Problem)is a typical NP- hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP. By employing exchange heuristic crossover and exchange mutation operators, a new method based genetic algorithm for solving TSP is presented. The experimental results simulated on several TSPs show that this algorithm is effective and feasible to solve TSP.
出处
《计算机与数字工程》
2006年第4期52-55,共4页
Computer & Digital Engineering
关键词
旅行商问题
遗传算法
组合优化
traveling salesman problem(TSP), genetic algorlthm, combinatorial optimization