“Optimal” neural representation of higher order for traveling salesman problems

DOI Web Site Web Site 被引用文献2件 参考文献12件

書誌事項

公開日
2002-08-15
権利情報
  • http://onlinelibrary.wiley.com/termsAndConditions#vor
DOI
  • 10.1002/ecjb.10070
公開者
Wiley

この論文をさがす

説明

<jats:title>Abstract</jats:title><jats:p>The optimal formulation has been shown based on theoretical measure when the combinatorial optimization problem with linear cost function is solved by a symmetrically connected neural network (Hopfield network)<jats:ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#bib15">15</jats:ext-link>; however, in this paper, we will present an optimal formulation of higher order for traveling salesman problems defined by a quadratic cost function. The Hopfield neural network constructed by this formulation becomes higher order, and the asymptotic stability and the optimal solution will coincide so far as the vertex of the hypercube which expresses the network state is concerned. Therefore, an optimal solution can always be obtained if the network converges to the vertex. We will confirm by simulations that a good solution of the optimal solutions can be obtained with higher frequency compared to the conventional formulation. © 2002 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 85(9): 32–42, 2002; Published online in Wiley InterScience (<jats:ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www. interscience.wiley.com">www. interscience.wiley.com</jats:ext-link>). DOI 10.1002/ecjb.10070</jats:p>

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (12)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ