Summary
International Symposium on Nonlinear Theory and its Applications
2008
Session Number:C2L-E
Session:
Number:C2L-E3
ID model with Higher-Order Connections for the Traveling Salesman Problem
Takahiro SOTA , Yoshihiro HAYAKAWA, Koji NAKAJIMA,
pp.-
Publication Date:2008/9/7
Online ISSN:2188-5079
Summary:
We can solve the N-Queen problem, which belongs to a particular kind of combinatorial optimization problems, by using the Inverse function Delayed (ID) network with normal connections and the success rate achieves 100%. In such a case, if and only if the state of the ID network is stationary, it always shows an optimal solution. This feature is very useful because of an easy judgment. However, it is hard to solve the Traveling Salesman Problem (TSP) with this model. The problem is that the network states between an optimal solution and the others are not always separable. In this paper, we propose the ID model with higher-order synapse connections (HC-ID) to solve this problem. We demonstrate that the HC-ID model works to separate between the optimal solutions and the others very well. In addition, in computer simulations, it is shown that optimal solutions of the TSP are also only stationary states.