Neural techniques for combinatorial optimization with applications
Authors:
- K. SmithKSK. Smith
- M. PalaniswamiMPM. Palaniswami
- M. KrishnamoorthyMKM. Krishnamoorthy
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 9 (6) , 1301-1318
Abstract
After more than a decade of research, there now exist several neural-network techniques for solving NP-hard combinatorial optimization problems. Hopfield networks and self-organizing maps are the two main categories into which most of the approaches can be divided. Criticism of these approaches includes the tendency of the Hopfield network to produce infeasible solutions, and the lack of generalizability of the self-organizing approaches (being only applicable to Euclidean problems). This paper proposes two new techniques which have overcome these pitfalls: a Hopfield network which enables feasibility of the solutions to be ensured and improved solution quality through escape from local minima, and a self-organizing neural network which generalizes to solve a broad class of combinatorial optimization problems. Two sample practical optimization problems from Australian industry are then used to test the performances of the neural techniques against more traditional heuristic solutions.Keywords
This publication has 30 references indexed in Scilit:
- Static and dynamic channel assignment using neural networksIEEE Journal on Selected Areas in Communications, 1997
- An argument for abandoning the travelling salesman problem as a neural-network benchmarkIEEE Transactions on Neural Networks, 1996
- Neural versus traditional approaches to the location of interacting hub facilitiesLocation Science, 1996
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problemEuropean Journal of Operational Research, 1996
- A hybrid neural approach to combinatorial optimizationComputers & Operations Research, 1996
- Neural Network Parallel Computing1992
- A study of the application of Kohonen-type neural networks to the Travelling Salesman ProblemBiological Cybernetics, 1991
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problemBiological Cybernetics, 1988
- On the stability of the Travelling Salesman Problem algorithm of Hopfield and TankBiological Cybernetics, 1988
- A traveling salesman objective function that works1988