Using stochastic chaotic simulated annealing in the FPGA segmented channel routing problem

Field programmable gate array (FPGA) segmented channel routing is a difficult combinatorial optimization problem. Neural networks have been successfully used to solve this problem. The Hopfield neural network (HNN) is easily stuck in local minimum but not global minimum, resulting in difficulties in finding the optional solution. This paper applies stochastic chaotic simulated annealing (SCSA) to the FPGA segmented channel routing problem (FSCRP) and compares the solutions of SCSA and the HNN.