Issue No. 02 - February (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.204794
<p>A hybrid neural network model for solving optimization problems is proposed. An energy function which contains the constraints and cost criteria of an optimization problem is derived, and then the neural network is used to find the global minimum (or maximum) of the energy function, which corresponds to a solution of the optimization problem. The network contains two subnets: a constraint network and a goal network. The constraint network models the constraints of an optimization problem and computes the gradient (updating) value of each neuron such that the energy function monotonically converges to satisfy all constraints of the problem. The goal network points out the direction of convergence for finding an optimal value for the cost criteria. These two subnets ensure that the neural network finds feasible as well as optimal (or near-optimal) solutions. The traveling salesman problem and the Hamiltonian cycle problem are used to demonstrate the method.</p>
hybrid neural network model; optimization problems; energy function; constraints; cost criteria; global minimum; goal network; traveling salesman problem; Hamiltonian cycle problem; constraint handling; neural nets; operations research; optimisation.
K. Sun and H. Fu, "A Hybrid Neural Network Model for Solving Optimization Problems," in IEEE Transactions on Computers, vol. 42, no. , pp. 218-227, 1993.