一种适用于求解TSP问题的改进的禁忌算法.pdfVIP

and ComputerEngineeringApplications计算机工程与应用 一种适用于求解TSP问题的改进的禁忌算法 武 妍，周 欣 WUYan。ZHOUXin 同济大学计算机科学与工程系，上海200092 of Scienceand 200092，China DepartmentComputer Engineering，Ton西iUniversity，Shanghai E-mail：yanwu@mail．tongji．edu．en WUYan．ZHOUXin．Meliorativetabusearch forTSP and algorithm problem．ComputerEngineeringApplications， 2008，44(1)：57—59． Abstract：Basedonthebasic oftraditionalTabusearch meliorativeTabusearch for concepts algorithm，a algorithmsolving髑P been ininitialsolution’S structureandtaboo has has proposed．Thisalgorithmgreatimprovement production，neighbor strategy． Furthermore，itmakesfulluseofheuristicinformationandTabusearch first，this dividesthe algorithm’Sadvantages．Atalgorithm into can theinitial citiesintocertainareas．nen，itconnectstheseareas a that，we solution．Meanwhile，we path，SO get produce thecities listandusethemwiththe taboo tobreak thelocal this k-neighbor improvedstrategies through optimum．Inpaper，we thatthenovel the tOsolvetheCHNl44 andsome inTSP resultshows applyalgorithm problem problems library(TSPLIB)．The canachievesatisfiedsolutionwithsatisfied algorithm speed． words：Tabusearch SalesmanProblem Key algorithm；heuristicalgorithm；Traveling 摘要：利用传统的禁忌算法的基本思想，针对TSP问题，提出了一种改进的禁忌算法(MTS)。该算法在初始解的生成，邻域结构 及禁忌策略方面进行了大的改进，充分地利用了问题本身的启发式信息与禁忌算法的优点。算法首先通过对城市分区，然后对区 域连接，生成初始解；同时生成每个城市的后邻居列表，利用k邻居列表和改进的禁忌策略来突破局部最优。通过对CHNl44