A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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