An automata network for performing combinatorial optimization

Neurocomputing

Volumn 47, Issue 1-4, 2002, Pages 59-83

  Xu, Zong Ben ^a   Jin, Hui Dong ^b   Leung, Kwong Sak ^b   Leung, Yee ^b   Wong, Chak Kuen ^b  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Automata network; Boltzmann machine; Combinatorial optimzation; Hopfield network; Winner Take All

Indexed keywords

AUTOMATA THEORY; BENCHMARKING; COMPUTER SIMULATION; NEURAL NETWORKS; OPTIMIZATION; SPECIFICATIONS;

AUTOMATA NETWORKS;

PROBLEM SOLVING;

ARTIFICIAL NEURAL NETWORK; AUTOMATION; COMPUTER SIMULATION; INTERMETHOD COMPARISON; METHODOLOGY; PRIORITY JOURNAL; PROBLEM SOLVING; PROCESS OPTIMIZATION; RELIABILITY; REVIEW; THEORETICAL STUDY; VALIDATION PROCESS;

EID: 0036707177     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-2312(01)00580-X     Document Type: Review

References (30)

1. E. Abates, J. Korst, Simulated Annealing and Boltzmann Machine, Wiley, New York, 1988.
2. S. Abe, Global convergence and suppression states of the Hopfield neural networks, IEEE Trans. Circuit. System 40 (1993) 246-257.
3. S. Abe, Convergence acceleration of the Hopfield neural network by optimization integration step sizes, IEEE Trans. System, Man and Cybern.-Part B 26 (1) (1996) 194-201.
4. S.V.B. Aiyer, Solving combinatorial optimization problems using neural networks with applications in speech recognition, Technical Report CUED/F-INFENF/TR 89, Department of Engineering, Cambridge University, 1991.
5. S.V.B. Aiyer et al., A theoretical investigation into the performance of the Hopfield model, IEEE Trans. Neural Networks 1 (1990) 204-215.
6. A.R. Bizzarri, Convergence properties of a modified Hopfield-Tank model, Biol. Cybern. 64 (1991) 293-300.
7. M. Budinich, A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing, Neural Comput. 8 (1996) 416-424.
8. G. Carpaneto et al., Algorithm 750: Cdt: a subroutine for the exact solution of large-scale, symmetric traveling salesman problems, ACM Trans. Math. Software 21 (4) (1995) 410-415.
9. M.A. Cohen, S. Grossberg, Absolute stability of global pattern formation and parallel memory storage by competitive neural networks, IEEE Trans. Systems, Man, and Cybern. 13 (1983) 815-825.
10. H. Crowder, M.W. Padberg, Solving large-scale symmetric traveling problems to optimality, Manage. Sci. 26 (1980) 495-509.
11. F. Deutsch, The alternating method of von. Neumann multivariate approximation theory, in: W. Schempp, K. Zeller (Eds.), ISNM51, Birkhäuser, Basel, 1979, pp. 83-96.
12. F. Favata, R. Walker, A study of the application of kohonen-type neural networks to the traveling salesman problem, Biol. Cybern. 64 (1991) 463-468.
13. J. Feldmann, D. Ballard, Connectionist models and their properties, Cognitive Sci. 6 (1982) 205-254.
14. D.B. Fogel, An evolutionary approach to the traveling salesman problem, Biol. Cybern. 60 (1988) 139-144.
15. E. Goles, S. Martinez, Neural and Automata Networks, Kluwer Academic Publishers, Norwell, MA, 1990.
16. S. Grossberg, Nonlinear neural networks: principles, mechanisms, and architectures, Neural Networks 1 (1988) 17-61.
17. J.J. Hopfield, D.W. Tank, Neural computation of decisions in optimization problems, Bio. Cybern. 52 (1985) 141-152.
18. B. Kamgar-Parsi, On problem solving with Hopfield neural networks, Biol. Cybern. 62 (1990) 415-423.
19. S.G. Kirkpatrick Jr., C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
20. T. Kohonen, Self-organized formation of topologically correct feature maps, Biol. Cybern. 43 (2) (1982) 59-69.
21. Y. Leung, J.S. Zhang, Z.S. Xu, Neural networks for convex hull computation, IEEE Trans. Neural Networks 8 (3) (1997) 601-611.
22. A. Likas, A. Stafylopatis, Group updates and multiscaling: an efficient neural network approach to combinatorial optimization, IEEE Trans. System, Man Cybern.-Part B 26 (2) (1996) 222-232.
23. S. Lin, B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21 (1973) 498-516.
24. W.S. McCulloch, W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys. 5 (1943) 115-133.
25. M. Peng, N.K. Gupta, A.F. Armitage, An investigation into the improvement of local minima of the Hopfield network, Neural Networks 9 (7) (1996) 1241-1253.
26. P.C. Percy, Y.H. Pao, Combinatorial optimization with use of guided evolutionary simulated annealing, IEEE Trans. Neural Networks 6 (2) (1995) 290-295.
27. C. Peterson, Parallel distributed approaches to combinatorial optimization: benchmark studies on traveling salesman problem, Neural Comput. 2 (1990) 261-269.
28. S. Porat, Stability and looping in connection models with asymmetric weights, Biol. Cybern. 60 (1989) 335-344.
29. Z.B. Xu, G.Q. Hu, C.P. Kwong, Asymmetric Hopfield-type networks: theory and applications, Neural Networks 9 (3) (1996) 483-501.
30. Z.B. Xu, C.P. Kwong, A decomposition principle for complexity reduction of artificial neural networks, Neural Networks 6 (1996) 999-1016.