A neural network algorithm for the multiple traveling salesmen problem
We developed an efficient neural network algorithm for solving the Multiple Traveling Salesman Problem (MTSP). A new transformation of the N-city, M-salesman MTSP to the standard Traveling Salesmen Problem (TSP) is introduced. The transformed problem is represented by an expanded version of Hopfield-Tank's neuromorphic city-position map with (N + M /minus/ 1)-city and a single fictitious salesman. The dynamic model associated with the problem is based on the Basic Differential Multiplier Method (BDMM) which evaluates Lagrange multipliers simultaneously with the problem's state variables. The algorithm was successfully tested on many problems with up to 30 cities and five salesmen. In all test cases, the algorithm always converged to valid solutions. The great advantage of this kind of algorithm is that it can provide solutions to complex decision making problems directly by solving a system of ordinary differential equations. No learning steps, logical if statements or adjusting of parameters are required during the computation. The algorithm can therefore be implemented in hardware to solve complex constraint satisfaction problems such as the MTSP at the speed of analog silicon VLSI devices or possibly future optical neural computers. 29 refs., 7 figs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6600625
- Report Number(s):
- ORNL/TM-10799; CESAR-88/49; ON: DE89004150
- Country of Publication:
- United States
- Language:
- English
Similar Records
A concurrent neural network algorithm for the traveling salesman problem
Computational-complexity reduction for neural network algorithms