摘要
针对在解决旅行商问题时标准遗传算法效率不高,很容易陷入局部最优解的问题,提出了一种改进的遗传算法.根据种群个体的多样性和分布情况,提出了判定遗传算法截止代数的方法.研究结果表明,通过加入了初始化信息,改进交差算子,可提高遗传算法的精确性和收敛性.
Standard genetic algorithm in solving the traveling salesman problem （TSP） is not efficient since it is easy to fall into local optimal solution. To improve the efficiency of genetic algorithm, this paper presents an improved genetic algorithm. First, according to the diversity of individuals and the population distribution, the method to determine the cut-off algebraic of genetic algorithm is proposed. Second, by adding initialization information and improving cross- operator, the accuracy and convergence of the genetic algorithm could be improved.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2013年第4期390-393,共4页
Transactions of Beijing Institute of Technology
基金
国家自然科学基金资助项目(60475022)
山西省科技厅软科学资助项目(2011041022-03)
关键词
遗传算法
旅行商(TSP)
截止代数
交叉算子
genetic algorithm
travelling salesman problem（TSP）
end algebra
crossover operator
