An Adaptive Genetic Algorithm for Solving Traveling Salesman Problem

作者:Wang Jina; Huang Jian; Rao Shuqin; Xue Shaoe; Yin Jian
来源:4th International Conference on Intelligent Computing, 2008-09-15 to 2008-09-18.

摘要

Traveling salesman problem (TSP) is a classical NP-hard problem in combinational optimization. This paper adopted a novel genetic algorithm which adjust the crossover probability and mutation probability adaptively based on clustering and fuzzy system, and designed a new crossover operator to improve the performance of genetic algorithm (GA) for TSP. Experiments show that the proposed method is much better than the standard genetic algorithm with a higher convergent rate and success rate.