DocumentCode
2656619
Title
An approach for solving dynamic TSPs using neural networks
Author
Shinozawa, Kazuhiko ; Uchiyama, Tadasu ; Shimohara, Katsunori
Author_Institution
NTT Human Interface Lab., Kanagawa, Japan
fYear
1991
fDate
18-21 Nov 1991
Firstpage
2450
Abstract
An approach for solving the D-TSP (dynamic traveling salesman problem) is discussed. The difference between a TSP and a D-TSP is that, in the latter, traveling costs between cities change according to the time of day. A neural network was applied to a D-TSP. This D-TSP was given a two-dimensional representation. With several maps, minimum cost tours were found by computer simulation using a Hopfield-Tank-type neural network
Keywords
neural nets; operations research; D-TSP; Hopfield-Tank-type neural network; computer simulation; dynamic traveling salesman problem; minimum cost tours; neural networks; operations research; two-dimensional representation; Cities and towns; Costs; Humans; Joining processes; Laboratories; Neural networks; Road transportation; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN
0-7803-0227-3
Type
conf
DOI
10.1109/IJCNN.1991.170756
Filename
170756
Link To Document