TY - GEN
T1 - A fast elastic net method for traveling salesman problem
AU - Yi, Junyan
AU - Bi, Weixing
AU - Yang, Gang
AU - Tang, Zheng
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=67449136148&partnerID=8YFLogxK
U2 - 10.1109/ISDA.2008.52
DO - 10.1109/ISDA.2008.52
M3 - 会議への寄与
AN - SCOPUS:67449136148
SN - 9780769533827
T3 - Proceedings - 8th International Conference on Intelligent Systems Design and Applications, ISDA 2008
SP - 462
EP - 467
BT - Proceedings - 8th International Conference on Intelligent Systems Design and Applications, ISDA 2008
T2 - 8th International Conference on Intelligent Systems Design and Applications, ISDA 2008
Y2 - 26 November 2008 through 28 November 2008
ER -