A memetic algorithm with genetic particle swarm optimization and neural network for maximum cut problems

作者: Jiahai Wang

DOI: 10.1007/978-3-540-74769-7_33

关键词:

摘要: In this paper, we incorporate a chaotic discrete Hopfield neural network (CDHNN), as local search scheme, into genetic particle swarm optimization (GPSO) and develop memetic algorithm GPSO-CDHNN for the maximum cut problem. The proposed not only performs exploration by using population-based evolutionary ability of GPSO, but also exploitation CDHNN. Simulation results show that has superior problems.

参考文章(20)
Michel X. Goemans, David P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of the ACM. ,vol. 42, pp. 1115- 1145 ,(1995) , 10.1145/227683.227684
P. Y. Yin, Genetic particle swarm optimization for polygonal approximation of digital curves Pattern Recognition and Image Analysis. ,vol. 16, pp. 223- 233 ,(2006) , 10.1134/S105466180602009X
A. Bertoni, P. Campadelli, G. Grossi, An approximation algorithm for the maximum cut problem and its experimental analysis Discrete Applied Mathematics. ,vol. 110, pp. 3- 12 ,(2001) , 10.1016/S0166-218X(00)00299-7
G. Galán-Marı́n, E. Mérida-Casermeiro, J. Muñoz-Pérez, Modelling competitive Hopfield networks for the maximum clique problem Computers & Operations Research. ,vol. 30, pp. 603- 624 ,(2003) , 10.1016/S0305-0548(02)00028-X
Jiahai Wang, Zheng Tang, Qiping Cao, Ronglong Wang, None, Optimal competitive hopfield network with stochastic dynamics for maximum cut problem. International Journal of Neural Systems. ,vol. 14, pp. 257- 265 ,(2004) , 10.1142/S0129065704002029
Jiahai Wang, Zheng Tang, An improved optimal competitive Hopfield network for bipartite subgraph problems Neurocomputing. ,vol. 61, pp. 413- 419 ,(2004) , 10.1016/J.NEUCOM.2004.03.012
Chang-song Zhou, Tian-lun Chen, Chaotic annealing for optimization Physical Review E. ,vol. 55, pp. 2580- 2587 ,(1997) , 10.1103/PHYSREVE.55.2580
C. Helmberg, F. Rendl, A Spectral Bundle Method for Semidefinite Programming Siam Journal on Optimization. ,vol. 10, pp. 673- 696 ,(1999) , 10.1137/S1052623497328987
Steven J. Benson, Yinyu Ye, Xiong Zhang, Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization Siam Journal on Optimization. ,vol. 10, pp. 443- 461 ,(1999) , 10.1137/S1052623497328008
Complexity of Computer Computations Mathematics of Computation. ,vol. 28, pp. 667- ,(1972) , 10.1007/978-1-4684-2001-2