DocumentCode :
729370
Title :
Using passive neural networks to solve TSP
Author :
Luksza, Andrzej ; Sienko, Wieslaw
Author_Institution :
Dept. of Electr. Eng., Gdynia Maritime Univ., Morska, Poland
fYear :
2015
fDate :
24-26 June 2015
Firstpage :
79
Lastpage :
84
Abstract :
Numeric experiments on random, relatively large travelling salesman problems presented in this paper show that passive neural networks can be used as an efficient, dynamic optimization tool for combinatorial programming.
Keywords :
dynamic programming; neural nets; travelling salesman problems; TSP; combinatorial programming; dynamic optimization tool; passive neural networks; travelling salesman problems; Biological neural networks; Cities and towns; Linear programming; Neurons; Optimization; Symmetric matrices; Combinatorial Optimization; Passive Neural Networks; Traveling Salesman Problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cybernetics (CYBCONF), 2015 IEEE 2nd International Conference on
Conference_Location :
Gdynia
Print_ISBN :
978-1-4799-8320-9
Type :
conf
DOI :
10.1109/CYBConf.2015.7175910
Filename :
7175910
Link To Document :
بازگشت