An evolutionary neural network algorithm for max cut problems

An "evolutionary neural network (ENN)" is presented for the max cut problem of an undirected graph G(V, E) in this paper. The goal of the NP-hard problem is to find a partition of V into two disjoint subsets such that the cut size be maximized. The cut size is the sum of weights on edges in E whose endpoints belong to different subsets. The ENN combines the evolutionary initialization scheme of the neural state into the energy minimization criteria of the binary neural network. The performance of ENN is evaluated through simulations in randomly weighted complete graphs and unweighted random graphs with up to 1000 vertices. The results show that the evolutionary initialization scheme drastically improves the solution quality. ENN can always find better solutions than the maximum neural network, the mean field annealing, the simulated annealing, and the greedy algorithm.

[1]  Nobuo Funabiki,et al.  A binary neural network approach for max cut problems , 1996 .

[2]  Svatopluk Poljak,et al.  Max-cut in circulant graphs , 1992, Discret. Math..

[3]  Charles Delorme,et al.  The performance of an eigenvalue bound on the max-cut problem in some classes of graphs , 1993, Discret. Math..

[4]  Seishi Nishikawa,et al.  Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems , 1996 .

[5]  Takakazu Kurokawa,et al.  Bus connected neural network hardware system , 1994 .

[6]  Carsten Peterson,et al.  Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..

[7]  Yoshiyasu Takefuji,et al.  A Neural Network Model for Finding a Near-Maximum Clique , 1992, J. Parallel Distributed Comput..

[8]  Yoshiyasu Takefuji,et al.  A parallel improvement algorithm for the bipartite subgraph problem , 1992, IEEE Trans. Neural Networks.

[9]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[10]  Yoshiyasu Takefuji,et al.  A maximum neural network for the max cut problem , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[11]  Chi-Ping Hsu.  Minimum-Via Topological Routing , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[13]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[14]  Yoshiyasu Takefuji,et al.  A neural network parallel algorithm for clique vertex-partition problems , 1992 .

[15]  Yoshiyasu Takefuji,et al.  Neural network parallel computing , 1992, The Kluwer international series in engineering and computer science.