A real-time solution for the traveling salesman problem using a Boolean neural network

It is shown that the Boolean neural network can be used to solve NP-complete problems. The problem under consideration is the traveling salesman problem. The Boolean neural network is modified to include the iterative procedure for solving combinatorial optimization problems. An architecture that ut...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Neural Networks 1993 s. 1096 - 1103 vol.2
Hlavní autoři: Bhide, S., John, N., Kabuka, M.R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1993
Témata:
Approximation algorithms
Circuit simulation
Iterative algorithms
Mathematical model
Minimization
Neural networks
NP-complete problem
Simulated annealing
Space exploration
Traveling salesman problems
ISBN:0780309995, 9780780309999
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:It is shown that the Boolean neural network can be used to solve NP-complete problems. The problem under consideration is the traveling salesman problem. The Boolean neural network is modified to include the iterative procedure for solving combinatorial optimization problems. An architecture that utilizes this modified Boolean neural network is proposed for solving this problem. The simulation results are found to be comparable to the simulated annealing algorithm, which is used as a test base. The results show a better variance as compared to simulated annealing. The modified Boolean neural network implementation involves lesser hardware complexity, good noise immunity and faster circuitry.< >
ISBN:0780309995
9780780309999
DOI:10.1109/ICNN.1993.298711