Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11861/7651
Title: | An automata network for performing combinatorial optimization |
Authors: | Xu, Zong-Ben Jin, Hui-Dong Prof. LEUNG Kwong Sak Leung, Yee Wong, Chak-Kuen |
Issue Date: | 2002 |
Publisher: | Elsevier |
Source: | Neurocomputing,2002, vol. 47(1-4), pp. 59 - 83 |
Journal: | Neurocomputing |
Abstract: | There have been several neural network approaches to the tasks of solving combinatorial optimization problems. In this paper, a new type of neural networks-the WTA-type networks, which incorporates the Winner-Take-All mechanism into the automata networks, is proposed. Five specifications of the WTA-type networks (N1-N5) are presented. The theoretical foundations of the networks are developed from the standpoint of taking them as combinatorial optimization solvers. We also investigate the two key issues, reliability and efficiency, related to the application of the networks. The proposed networks and the established theories are applied to a set of combinatorial optimization benchmark problems-traveling salesman problems. The simulation results demonstrate that the proposed WTA-type networks are more effective or comparable with the Hopfield networks, the Boltzmann machine and the self-organizing feature map network. © 2002 Elsevier Science B.V. All rights reserved. |
Type: | Peer Reviewed Journal Article |
URI: | http://hdl.handle.net/20.500.11861/7651 |
ISSN: | 09252312 |
DOI: | 10.1016/S0925-2312(01)00580-X |
Appears in Collections: | Applied Data Science - Publication |
Find@HKSYU Show full item record
SCOPUSTM
Citations
13
checked on Nov 17, 2024
Page view(s)
29
Last Week
0
0
Last month
checked on Nov 21, 2024
Google ScholarTM
Impact Indices
Altmetric
PlumX
Metrics
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.