期刊名称：Neural Information Processing: Letters and Reviews
电子版ISSN：1738-2532
出版年度：2007
卷号：11
期号：7
页码：159-164
出版社：Neural Information Processing
摘要：In this paper, we propose a Simulated Annealing PolyClonal Selection Algorithm (SAPCSA) for Traveling Salesman
Problems (TSP). By introducing a simulated annealing (SA) strategy to the PolyClonal Selection Algorithm (PCSA),
the SAPCSA integrate the characteristics of both SA and PCSA. Numerous instances have been simulated to verify
the proposed algorithm.
