An Improved Clonal Selection Algorithm and Its Application to Traveling Salesman Problems

S. GAO, Z. TANG, H. DAI, J. ZHANG
2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
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.
doi:10.1093/ietfec/e90-a.12.2930 fatcat:rq6iavduajcxfnd43ozyu5n6vi