Dynamic Analysis and FPGA Implementation of New Chaotic Neural Network and Optimization of Traveling Salesman Problem

被引:10
|
作者
Cui, Li [1 ]
Chen, Chaoyang [1 ]
Jin, Jie [1 ]
Yu, Fei [2 ]
机构
[1] Hunan Univ Sci & Technol, Xiangtan 411201, Hunan, Peoples R China
[2] Changsha Univ, Sci & Technol, Sch Comp & Commun Engn, Changsha 410114, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
ALGORITHM; SYNCHRONIZATION; ROBUST; SOLVE; MODEL;
D O I
10.1155/2021/5521192
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A neural network is a model of the brain's cognitive process, with a highly interconnected multiprocessor architecture. The neural network has incredible potential, in the view of these artificial neural networks inherently having good learning capabilities and the ability to learn different input features. Based on this, this paper proposes a new chaotic neuron model and a new chaotic neural network (CNN) model. It includes a linear matrix, a sine function, and a chaotic neural network composed of three chaotic neurons. One of the chaotic neurons is affected by the sine function. The network has rich chaotic dynamics and can produce multiscroll hidden chaotic attractors. This paper studied its dynamic behaviors, including bifurcation behavior, Lyapunov exponent, Poincare surface of section, and basins of attraction. In the process of analyzing the bifurcation and the basins of attraction, it was found that the network demonstrated hidden bifurcation phenomena, and the relevant properties of the basins of attraction were obtained. Thereafter, a chaotic neural network was implemented by using FPGA, and the experiment proved that the theoretical analysis results and FPGA implementation were consistent with each other. Finally, an energy function was constructed to optimize the calculation based on the CNN in order to provide a new approach to solve the TSP problem.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] Performance Analysis of Local Optimization Algorithms in Traveling Salesman Problem
    Qu, Dapeng
    Tu, Hui
    Fan, Tiesheng
    ADVANCES IN MECHATRONICS, AUTOMATION AND APPLIED INFORMATION TECHNOLOGIES, PTS 1 AND 2, 2014, 846-847 : 1364 - +
  • [42] An Ant Colony Optimization for Weighted Traveling Salesman Problem and Analysis
    Guan, Jing
    Tang, Jiafu
    Yu, Yang
    2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 3852 - 3857
  • [43] The Implementation of a Pointer Network Model for Traveling Salesman Problem on a Xilinx PYNQ Board
    Gu, Shenshen
    Hao, Tao
    Yang, Shaofu
    ADVANCES IN NEURAL NETWORKS - ISNN 2018, 2018, 10878 : 130 - 138
  • [44] Elastic Neural Nets for the Traveling Salesman Problem
    Antoniou, I.
    Gorbunov, S.V.
    Ivanov, V.V.
    Kisel, I.V.
    Konotopskaya, E.V.
    Journal of Computational Methods in Sciences and Engineering, 2002, 2 (1-2) : 111 - 115
  • [45] EFFECTIVE NEURAL ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM
    XU, X
    TSAI, WT
    NEURAL NETWORKS, 1991, 4 (02) : 193 - 205
  • [46] FPGA-based implementation of genetic algorithm for the traveling salesman problem and its industrial application
    Skliarova, I
    Ferrari, AB
    DEVELOPMENTS IN APPLIED ARTIFICAIL INTELLIGENCE, PROCEEDINGS, 2002, 2358 : 77 - 87
  • [47] How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
    Liu, Shengcai
    Zhang, Yu
    Tang, Ke
    Yao, Xin
    IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2023, 18 (03) : 14 - 28
  • [48] A new approach for solving the Traveling Salesman Problem using Neural Networks
    Siqueira, Paulo Henrique
    Scheer, Sergio
    Arns Steiner, Maria Teresinha
    CISCI 2007: 6TA CONFERENCIA IBEROAMERICANA EN SISTEMAS, CIBERNETICA E INFORMATICA, MEMORIAS, VOL III, 2007, : 36 - +
  • [49] A NEW GENERALIZATION OF THE TRAVELING SALESMAN PROBLEM
    Alkaya, Ali Fuat
    Duman, Ekrem
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2010, 9 (02) : 162 - 175
  • [50] A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    CARLIER, J
    VILLON, P
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 245 - 253