基于选择性集成的整数编码遗传算法及TSP问题求解  

Integer Coding Genetic Algorithm Based on Selective Ensemble and Traveling Salesman Problem Solving

作　　者：蒋望东[1] 林士敏[2] 

机构地区：[1]湖南财经高等专科学校信息管理系,湖南长沙410205 [2]广西师范大学计算机科学系,广西桂林541004

出　　处：《计算机与现代化》2007年第5期38-40,43,共4页Computer and Modernization

基　　金：国家自然科学基金资助项目(60473115)

摘　　要：基于遗传算法的求解TSP(Traveling Salesman Problem)研究是近几年的研究热点。设计高效的遗传算法求解,有重要的理论意义和实用价值。本文考察了基于整数编码的遗传算法的选择算子、交叉算子、变异算子,运用选择性集成的思想,将几种算子集成,随进化的进程对交叉概率和变异概率做自适应调整,用Matlab编写遗传算法程序,求解中国31城市TSP问题,获得了优于目前同类工作的结果。The research on traveling salesman problem using genetic algorithms is a hotspot in recent years. It is very important in theories and applications to design high quality genetic algorithms programs. This paper investigates select operators, cross operators, mutation operators based on integer coding, and applies them on solving traveling salesman problem with ensemble above operators based on selective ensemble concept. Making cross probability and mutation probability adaptive to evolutional process in programs writing by Matlab, experiment about TSP of Chinese 31 cities shows that this algorithm gets better result than current similar works.

关 键 词：整数编码 遗传算法 旅行商问题 MATLAB应用 选择性集成 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]