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.
展开▼
