基于邻域搜索的混合遗传算法及其在对称TSP中的应用  

A Hybrid Genetic Algorithm Based on Neighborhood Search andits Application in Symmetry TSP

作　　者：陆子强[1] 郭国雄[1] 蒋金山[1] 

机构地区：[1]华南理工大学应用数学系,广州510640

出　　处：《计算机工程与应用》2005年第7期79-81,96,共4页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:19901009)

摘　　要：基于邻域搜索的混合遗传算法是综合了遗传算法和邻域搜索算法各自优势的全局搜索算法。它既有遗传算法的全局搜索能力,又有高效的局部搜索能力。该算法较好地解决了两种不同算法结合所产生的矛盾。通过对对称TSP的实验表明,算法具有良好的全局寻优性能并得到很好的结果。A hybrid genetic algorithm based on neighborhood search is a global search algorithm which combines the respective advantages of hybrid genetic algorithm and neighborhood search algorithm.It has a global searching capacity of genetic algorithm as well as effective local searching capacity.This algorithm resolves contradictions between two different kinds of algorithms.The experimental research on symmetry TSP shows that this algorithm has a good performance of global searching and has obtained good results.

关 键 词：邻域搜索 混合遗传算法 TSP 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]