Title: Neural network approach to traveling salesman problem based on hierarchical city adjacency
Abstract: A neural network approach based on city adjacency has been proposed in order to solve the traveling salesman problems. This method, in which a novel energy function is used for TSPs, produces frequently several traveling closed subtours. To cope with this problem, the authors propose a method to make a traveling tour without any closed subtours, where hierarchical city adjacency is considered. It is easy to apply this technique recursively. Therefore, this approach is applicable to larger scale problems.
Publication Year: 2002
Publication Date: 2002-11-19
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 9
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot