A new approach to solve the traveling salesman problem
Neurocomputing
Multi-agent System for Management and Monitoring of Routes Surveillance
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Expert Systems with Applications: An International Journal
Advances in Engineering Software
Improved Clonal Selection Algorithm Combined with Ant Colony Optimization
IEICE - Transactions on Information and Systems
An execution time neural-CBR guidance assistant
Neurocomputing
Self-adaptive neural networks based on a Poisson approach for knowledge discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Research on the order picking optimization problem of the automated warehouse
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
TaskCBP: an intelligent agent for task planning in elderly care
International Journal of Computational Intelligence in Bioinformatics and Systems Biology
Information Sciences: an International Journal
Solving traveling salesman problems by artificial immune response
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A new neural network approach to the traveling salesman problem
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Hi-index | 0.00 |
As a typical combinatorial optimization problem, the traveling salesman problem (TSP) has attracted extensive research interest. In this paper, we develop a self-organizing map (SOM) with a novel learning rule. It is called the integrated SOM (ISOM) since its learning rule integrates the three learning mechanisms in the SOM literature. Within a single learning step, the excited neuron is first dragged toward the input city, then pushed to the convex hull of the TSP, and finally drawn toward the middle point of its two neighboring neurons. A genetic algorithm is successfully specified to determine the elaborate coordination among the three learning mechanisms as well as the suitable parameter setting. The evolved ISOM (eISOM) is examined on three sets of TSP to demonstrate its power and efficiency. The computation complexity of the eISOM is quadratic, which is comparable to other SOM-like neural networks. Moreover, the eISOM can generate more accurate solutions than several typical approaches for TSP including the SOM developed by Budinich, the expanding SOM, the convex elastic net, and the FLEXMAP algorithm. Though its solution accuracy is not yet comparable to some sophisticated heuristics, the eISOM is one of the most accurate neural networks for the TSP.