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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE International Conference on Neural Networks 1993 pp. 1096 - 1103 vol.2
Main Authors: Bhide, S., John, N., Kabuka, M.R.
Format: Conference Proceeding
Language:English
Published: IEEE 1993
Subjects:
Approximation algorithms
Circuit simulation
Iterative algorithms
Mathematical model
Minimization
Neural networks
NP-complete problem
Simulated annealing
Space exploration
Traveling salesman problems
ISBN:0780309995, 9780780309999
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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