计算机与现代化Issue(2)：34-39,6.DOI:10.3969/j.issn.1006-2475.2015.02.008
基于改进遗传算法的大规模 TSP 问题求解方案
A Solution of Large-scale TSP Based on Improved Genetic Algorithm
雷玉梅1
作者信息
- 1. 阜新高等专科学校，辽宁 阜新 123000
- 折叠
摘要
Abstract
TSP not only describes the problem of travelling around a number of cities, but also stands for a number of problems in some other fields.Thus, it is meaningful to find an effective solution to large-scale TSP.As for the solution to find the minimum distance of a loop consisting of a large number of cities in TSP, in this paper, we propose such a new solution based on genetic al-gorithms.It adopts the idea of dividing and ruling, and utilizes a genetic algorithm based on improved initialization method and genetic operators to improve its performance.Experimental results across multiple datasets illustrate the proposed algorithm per-forms well in optimizing convergence result and solving the problem of premature convergence to some extent.关键词
大规模TSP问题/最短路径/遗传算法/改进遗传算法Key words
large-scale TSP/shortest path/genetic algorithm/improved genetic algorithm分类
信息技术与安全科学引用本文复制引用
雷玉梅..基于改进遗传算法的大规模 TSP 问题求解方案[J].计算机与现代化,2015,(2):34-39,6.
