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 条
  • [21] A BOOLEAN NEURAL-NETWORK APPROACH FOR THE TRAVELING SALESMAN PROBLEM
    BHIDE, S
    JOHN, N
    KABUKA, MR
    IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (10) : 1271 - 1278
  • [22] Chaotic ant swarm for the traveling salesman problem
    Zhen Wei
    Fangzhen Ge
    Yang Lu
    Lixiang Li
    Yixian Yang
    Nonlinear Dynamics, 2011, 65 : 271 - 281
  • [23] Chaotic ant swarm for the traveling salesman problem
    Wei, Zhen
    Ge, Fangzhen
    Lu, Yang
    Li, Lixiang
    Yang, Yixian
    NONLINEAR DYNAMICS, 2011, 65 (03) : 271 - 281
  • [24] New Discrete Chaotic Particle Swarm Algorithm for Traveling Salesman Problem
    Li, Jiuyong
    Wang, Jing
    MANUFACTURING PROCESSES AND SYSTEMS, PTS 1-2, 2011, 148-149 : 210 - 214
  • [25] Analysis of the Dynamic Traveling Salesman Problem with Weight Changes
    Tinos, Renato
    2015 LATIN AMERICA CONGRESS ON COMPUTATIONAL INTELLIGENCE (LA-CCI), 2015,
  • [26] An Integer-Coded Chaotic Particle Swarm Optimization for Traveling Salesman Problem
    Chen Yue
    Zhang Yan-duo
    Lu Jing
    Tian Hui
    PROGRESS IN ROBOTICS, PROCEEDINGS, 2009, 44 : 372 - +
  • [27] An Efficient GPU Implementation of Ant Colony Optimization for the Traveling Salesman Problem
    Uchida, Akihiro
    Ito, Yasuaki
    Nakano, Koji
    2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 94 - 102
  • [28] Neural Networks and the Traveling Salesman problem
    Bemley, B
    IJCNN'01: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2001, : 547 - 548
  • [29] Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
    Gamboa, D
    Rego, C
    Glover, F
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) : 1154 - 1172
  • [30] An approach to dynamic traveling salesman problem
    Yan, XS
    Kang, LS
    Cai, ZH
    Li, H
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2418 - 2420