...
首页> 外文期刊>The journal of China Universities of Posts and Telecommunications >Theories on solving the travelling salesman problem based on artificial neural network and their applications
【24h】

Theories on solving the travelling salesman problem based on artificial neural network and their applications

机译:基于人工神经网络的旅行商问题求解理论及其应用

获取原文
获取原文并翻译 | 示例

摘要

NP-hard problems have appeared in many areas. In this article, it is discussed how to solve this kind of problems using artificial neural network -Hopfield/Tank model, especially the Travelling Salesman Problem(TSP). At first, a stability Analysis shows the conditions of the model to Converge to the vertices of the hypercube and its Relation with the parameters. And then, a HT model For solving TSP is formulated. Some theorems are Given to analyze the influence of parameter D on The three subspaces of the connection matrix in Which D is set to zero. Based on these analyses, a Dynamic analysis of the model is given and a set of Parameter's rules are established.
机译:NP难题已经出现在许多领域。本文讨论了如何使用人工神经网络-Hopfield / Tank模型解决此类问题,尤其是旅行商问题(TSP)。首先,稳定性分析显示了模型收敛到超立方体顶点的条件及其与参数的关系。然后,建立了用于求解TSP的HT模型。给出了一些定理来分析参数D对将D设置为零的连接矩阵的三个子空间的影响。基于这些分析,对模型进行了动态分析,并建立了一组参数规则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号