A Simple Candidate Set Method for Symmetric TSP
Yongsheng Liang · Journal of Shenzhen Institute of Information Technology · 2012
As a typical NP problem and an effective solution to combinatorial optimization problems,TSP(traveling salesman problem) has been extensively studied in the last few decades.Candidate set is often used in many algorithms to limit the selecting range in the process of choosing a next traveling destination or to initialize a local optimum solution,such as in LKH algorithm.A novel simple generating method of candidate set is proposed in this paper and applied to MAX-MIN Ant System(MMAS) for symmetric TSP problems.Experiment results show that this new method outperforms MMAS.It can also be used in other algorithms for symmetric TSP problems.