A Puzzle-Based Genetic Algorithm with Block Mining and Recombination Heuristic for the Traveling Salesman Problem-一种基于分块挖掘和复合启发式的旅行商问题的遗传算法.pdfVIP

ZZ．A withblock andrecombinationheuristicforthe ChangPC，HuangWH．Zhangpuzzle—basedgeneticalgorithm mining salesman OF AND COMPUTERSCIENCETECHNOLOGY949 traveling problem．JOURNAL 27(5)：937Sept．2012． DOI 10．1007／s11390—012—1275—3 APuzzle—Based Genetic withBlock and Algorithm Mining Recombination Heuristicforthe SalesmanProblem Traveling Pei—Chann Zhen—Zhen Chan91(张百栈)，Wei—HsiuHuan91(黄伟修)，andZhan92(JilnRJ-月1-) 1 Zc Department吖InformationManagement，YuanUniversity，Taoyuan32026,Taiwan，China 2Department吖ComputerScience，XiamenUniversity，Xiame”．?61005，China Received August24，2011；revisedJanuary5，2012 AbstractInthis introduceanewheuristic the ofant research，we approachusingconceptcolony toextract fiomthechromosomes for the patterns salesman generatedbypreviousgenerationssolvinggeneralizedtraveling heuristicis oftwo thefirst theACO is toestablishan problem．Theproposed composedphases．In phase techniqueadopted archive ofasetof blocksandofasetof tobevisited．Thesecond consisting non．overlapping remainingcities(nodesl phase isablockrecombinationwherethesetofblocksandtherestofcitiesarecombinedtoformanartificialchromosome． phase The artificial thenbe intoastandard generated chromosomes(ACs)willinjected geneticalgorithm(SGA)tospeedup the methodiscalled“PUZZle—BasedGenetic