An extension of the Hopfield-Tank model for solution of the multiple traveling salesmen problem
- 1 January 1988
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 305-324 vol.2
- https://doi.org/10.1109/icnn.1988.23943
Abstract
The authors develop an efficient neural network algorithm for solving the multiple traveling salesman problem (MTSP). A novel transformation of the N-city, M-salesman MTSP to the standard TSP is introduced. The transformed problem is represented by an expanded version of the Hopfield-Tank neuromorphic city-position map with (N+M-1)-cities and a single fictitious salesman. The dynamic model associated with the problem is based on the basic differential multiplier method. The algorithm was successfully tested on many problems with up to 30 cities and 5 salesmen. In all cases the algorithm converged to valid solutions.Keywords
This publication has 5 references indexed in Scilit:
- A concurrent neural network algorithm for the traveling salesman problemPublished by Association for Computing Machinery (ACM) ,1988
- On the stability of the Travelling Salesman Problem algorithm of Hopfield and TankBiological Cybernetics, 1988
- Absolute Stability of Global Pattern Formation and Parallel Memory Storage by Competitive Neural NetworksPublished by Elsevier ,1987
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen ProblemsOperations Research, 1986
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985