基于小生境遗传算法的MTSP问题求解  

Solution to MTSP Based on Niche Genetic Algorithm

作　　者：张俐[1,2] 

机构地区：[1]湖南农业大学,湖南长沙410128 [2]湖南商务职业技术学院,湖南长沙410205

出　　处：《系统工程》2009年第7期119-121,共3页Systems Engineering

摘　　要：将生物学的小生境概念引入到基本遗传算法(GA)中,并对遗传操作作了改进,形成了小生境遗传算法,可应用于典型的组合优化问题——MTSP问题的求解,用共享度改变个体的适应值,同时加速淘汰适应值低的个体,提高每一代个体的平均适应值水平,以减少迭代的次数。给出的算例验证了算法的有效性。Based on GA, this paper introduces Niche, a concept of biology, improves genetic operators, and then forms the Niche Genetic algorithm that can be used in solving a traditional combinatorial optimum problem - MTSP. This algorithm changes individual adaptive value with sharing degree, accelerates to eliminate individual which have low adaptive value, increases the average adaptive value of every generation, and achieves the goal of reducing iterative times. Test results on the example indicate the feasibility of the proposed algorithm.

关 键 词：多旅行商问题 小生境 遗传算法 优化 

分 类 号：O229[理学—运筹学与控制论]