Output-threshold coupled neural network for solving the shortest path problems

被引:9
|
作者
Zhang, JY [1 ]
Wang, DF
Shi, MH
Wang, JY
机构
[1] Xidian Univ, Key Lab Radar Signal Proc, Xian 710071, Peoples R China
[2] Xian Engn Sci & Technol Inst, Dept Comp, Xian 710048, Peoples R China
[3] Xidian Univ, Inst Comp Sci, Xian 710071, Peoples R China
[4] Virginia Polytech Inst & State Univ, Dept Elect & Comp Engn, Alexandria, VA 22314 USA
来源
基金
中国国家自然科学基金;
关键词
shortest path problem; pulse-coupled neural networks (PCNNs); autowave; output-threshold coupled neural networks (OTCNNs);
D O I
10.1360/02yf0313
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a coupled neural network, called output-threshold coupled neural network (OTCNN), which can mimic the autowaves in the present pulsed coupled neural networks (PCNNs), by the construction of mutual coupling between neuron outputs and the threshold of a neuron. Based on its autowaves, this paper presents a method for finding the shortest path in shortest time with OTCNNs. The method presented here features much fewer neurons needed, simplicity of the structure of the neurons and the networks, and large scale of parallel computation. It is shown that OTCNN is very effective in finding the shortest paths from a single start node to multiple destination nodes for asymmetric weighted graph, with a number of iterations proportional only to the length of the shortest paths, but independent of the complexity of the graph and the total number of existing paths in the graph. Finally, examples for finding the shortest path are presented.
引用
收藏
页码:20 / 33
页数:14
相关论文
共 50 条
  • [31] Assessing network vulnerability using shortest path network problems
    Ye, Qian
    Kim, Hyun
    JOURNAL OF TRANSPORTATION SAFETY & SECURITY, 2021, 13 (01) : 1 - 25
  • [32] Shortest-path algorithm using adjustable weight pulse-coupled neural network
    Du, Hua
    Zhou, Dongming
    Zhao, Dongfeng
    Bai, Yunhong
    Lin, Lin
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 269 - 273
  • [33] A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network
    Zhou, Dongming
    Nie, Rencan
    Zhao, Dongfeng
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2008, 5227 : 9 - 18
  • [34] Shortest path network problems with stochastic arc weights
    Jordan, Jeremy D.
    Uryasev, Stan
    OPTIMIZATION LETTERS, 2021, 15 (08) : 2793 - 2812
  • [35] Shortest path network problems with stochastic arc weights
    Jeremy D. Jordan
    Stan Uryasev
    Optimization Letters, 2021, 15 : 2793 - 2812
  • [36] Neural network for shortest path algorithm and its application
    Ma, Chuanshui
    Ruan, Chuangai
    Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications, 1999, 22 (04): : 9 - 13
  • [37] Solving path problems on a network of computers
    Manger, Robert
    Informatica (Ljubljana), 2002, 26 (01) : 91 - 100
  • [38] Partial Node Failure in Shortest Path Network Problems
    Ye, Qian
    Kim, Hyun
    SUSTAINABILITY, 2019, 11 (22)
  • [39] A dual neural network for shortest-path routing
    Wang, J
    1997 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, 1997, : 1295 - 1298
  • [40] A wave time-varying neural network for solving the time-varying shortest path problem
    Zhilei Xu
    Wei Huang
    Jinsong Wang
    Applied Intelligence, 2022, 52 : 8018 - 8037