Three-tier multi-agent approach for solving traveling salesman problem
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Self-organizing feature map for cluster analysis in multi-disease diagnosis
Expert Systems with Applications: An International Journal
Approximate solution of the multiple watchman routes problem with restricted visibility range
IEEE Transactions on Neural Networks
Information Sciences: an International Journal
An improved multi-agent approach for solving large traveling salesman problem
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Large scale parallel iterated local search algorithm for solving traveling salesman problem
Proceedings of the 2012 Symposium on High Performance Computing
Multi-agent approach to distributed ant colony optimization
Science of Computer Programming
| Hi-index | 0.00 |
In addition to the classical heuristic algorithms of operations research, there have also been several approaches based on artificial neural networks for solving the traveling salesman problem. Their efficiency, however, decreases as the problem size (number of cities) increases. A technique to reduce the complexity of a large-scale traveling salesman problem (TSP) instance is to decompose or partition it into smaller subproblems. We introduce an all-neural decomposition heuristic that is based on a recent self-organizing map called KNIES, which has been successfully implemented for solving both the Euclidean traveling salesman problem and the Euclidean Hamiltonian path problem. Our solution for the Euclidean TSP proceeds by solving the Euclidean HPP for the subproblems, and then patching these solutions together. No such all-neural solution has ever been reported.