Optimal competitive hopfield network with stochastic dynamics for maximum cut problem.
In this paper, introducing stochastic dynamics into an optimal competitive Hopfield network model (OCHOM), we propose a new algorithm that permits temporary energy increases which helps the OCHOM escape from local minima. The goal of the maximum cut problem, which is an NP-complete problem, is to partition the node set of an undirected graph into two parts in order to maximize the cardinality of the set of edges cut by the partition. The problem has many important applications including the design of VLSI circuits and design of communication networks. Recently, Galán-Marín et al. proposed the OCHOM, which can guarantee convergence to a global/local minimum of the energy function, and performs better than the other competitive neural approaches. However, the OCHOM has no mechanism to escape from local minima. The proposed algorithm introduces stochastic dynamics which helps the OCHOM escape from local minima, and it is applied to the maximum cut problem. A number of instances have been simulated to verify the proposed algorithm.
Wang
Jiahai
J
Faculty of Engineering, Toyama University, Toyama-shi, 930-8555, Japan. wjiahai@hotmail.com
Tang
Zheng
Z
Cao
Qiping
Q
Wang
Ronglong
R
D000465:Algorithms; D000818:Animals; D003198:Computer Simulation; D006801:Humans; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D013269:Stochastic Processes; D013997:Time Factors