An Improved Transiently Chaotic Neural Network with Application to the Maximum Clique Problems

Abstract By analyzing the dynamic behaviors of the transiently chaotic neural network, we present a improved transiently chaotic neural network(TCNN) model for combinatorial optimization problems and test it on the maximum clique problem. Extensive simulations are performed and the results show that the improved transiently chaotic neural network model can yield satisfactory results on both some graphs of the DIMACS clique instances in the second DIMACS challenge and p-random graphs. It is superior to other algorithms in light of the solution quality and CPU time. Moreover, the improved model uses fewer steps to converge to saturated states in comparison with the original transiently chaotic neural network.