On the hybrid neural network model for solving optimization problems
A recent model of neural networks, named the Hybrid Neural Network Model (HN), for solving optimization problems appeared in . In , the main algorithm called the Hybrid Network Updating Algorithm (HNUA) is used to drive the HN model. The best thing about the HNUA is that it reaches a feasible solution very quickly. Our argument here is that while the HNUA is very quick to satisfy the constraints, it guarantees very little in terms of the quality of the generated solution. In this paper we rewrite one of the steps in the HNUA so that the goal function is better served. we demonstrate our work using the traveling salesman problem as an example.
Unable to display preview. Download preview PDF.
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco, CA: Freeman, 1979.Google Scholar
- “Introduction to Neural Networks, Computer Simulations of Biological Intelligence,” California Scientific Software, Pasadena, CA, 1988.Google Scholar