一种求解旅行商问题的交叉禁忌搜索_英文_.pdfVIP

18 4 © Vol. 18 No. 4 2006 4 Journal of System Simulation Apr., 2006 Crossover Tabu Search for Traveling Salesman Problem YANG Ning, TIAN Wei-feng, JIN Zhi-hua (Dept of Information Measurement Technology and Instruments, Shanghai Jiao Tong University, Shanghai 20030, China) Abstract: An improved tabu search – crossover tabu search (CTS) was proposed, which is applied for solving a well-known combinatorial optimization problem--the traveling salesman problem (TSP). The key strategies of the CTS are intensification strategy and diversification strategy. Intensification strategies, based on modifying choice rules to encourage move combinations, were used to enhance the efficiency of local search. Diversifications strategies were designed to drive the search into new regions, i.e., exploit the new search spaces. The CTS implement the crossover operator of the genetic algorithm (GA) as the diversification strategy, and the strategy for selecting elite solutions as the intensification strategy. CTS, standard TS, standard TS with intensification strategy and ant colony system (ACS) were used to solve the same TSP problems which come from the library of TSP instances TSPLIB and other three TSP instances of Fogel’s path. The results show better CTS performances than other kinds of algorithms. Key words: crossover tabu search; standard tabu search; crossover; intensification; diversification; TSP , , (, 200030) TS CTS