A Novel Genetic Algorithm for Traveling Salesman Problem Based on Neighborhood Code
ICINIS '09 Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent Systems(2009)
摘要
Classic genetic algorithm is not suitable to solve traveling salesman problem, because the encoding of the traveling salesman problem is either the permutations of the cities or the combinations of edges, which can not be directly operated by ordinary crossover or mutation operators. This paper introduces a novel encoding for traveling salesman problem, which can be operated by the ordinary crossover and mutation operators; and in order to accelerate the rate of the convergence, a novel local improvement approach is also presented.
更多查看译文
关键词
ordinary crossover,salesman problem,novel genetic algorithm,neighborhood code,novel local improvement approach,classic genetic algorithm,mutation operator,genetics,combinatorial optimization,traveling salesman problem,encoding,genetic algorithms,genetic algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络