Presentation 1998/3/19
Solving Large Traveling Salesman Problems Using Recurrent Neural Networks
Syunji Kajitani, Kunikazu Kobayashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is difficult to solve large traveling salesman problems (TSPs) by recurrent neural networks (RNNs). Because computational cost and required memory space increase remarkably as the number of cities does and also the solutions are not practical. In this paper, the large TSPs are assumed that RNNs cannot provide us the practical solutions. An algorithm to solve the large TSPs is proposed. Introducing a clustering method, a large TSP is divided into small TSPs, which can be easily solved by RNNs. If necessary this process is continued recursively. Then, such small TSPs are solved by each RNN. Finally, a whole route of the large TSP is derived from combining the routes of small TSPs. Through computer experiments, it is verified that the proposed method is effective for large TSPs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Traveling Salesman Problems / NP-hard / Recurrent Neural Network / Clustering
Paper #
Date of Issue

Conference Information
Committee NC
Conference Date 1998/3/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Neurocomputing (NC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Solving Large Traveling Salesman Problems Using Recurrent Neural Networks
Sub Title (in English)
Keyword(1) Traveling Salesman Problems
Keyword(2) NP-hard
Keyword(3) Recurrent Neural Network
Keyword(4) Clustering
1st Author's Name Syunji Kajitani
1st Author's Affiliation Graduate School of Science & Engineering, Yamaguchi University()
2nd Author's Name Kunikazu Kobayashi
2nd Author's Affiliation Faculty of Engineering, Yamaguchi University
Date 1998/3/19
Paper #
Volume (vol) vol.97
Number (no) 623
Page pp.pp.-
#Pages 5
Date of Issue