A Fast Elastic Net Method for Traveling Salesman Problem

Authors:
Junyan Yi;Weixing Bi;Gang Yang;Zheng Tang
Affiliations:
-;-;-;-
Venue:
ISDA '08 Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications - Volume 01
Year:
2008

Citing 0
Cited 2

Parallelized genetic ant colony systems for solving the traveling salesman problem

Expert Systems with Applications: An International Journal
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we proposed a fast method for improving the Elastic Net to solve the traveling salesman problem. A dynamic parameter strategy is introduced into the Elastic Net, which increases the ability of searching for the cities and helps the network get convergence with the optimal or near-optimal solution sooner. Simulations show that the proposed method is superior to the classical Elastic Net and some other neural networks both in light of solution quality and convergence speed.