Analysis and Application of Candidate Sets of Traveling Salesman Problem
Guoliang Chen · 2005
A statistical model depicting the properties of candidate sets is built,and the general ways are given to improve them.Using the intersection of local optimal solutions as the approximate backbone,a new meta-heuristic—Self-Adaptive Variable Candidate Sets Search(SAVCSS),which shrinks the candidate sets dynamically,is proposed.Furthermore,ILK and LKH are incorporated in the new meta-heuristic.Experiment results on TSPLIB indicated that the modified algorithms is capable of better performance in terms of solution quality.