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 条
  • [1] Output-threshold coupled neural network for solving the shortest path problems
    ZHANG Junying
    Computer Department
    Institute of Computer Science
    Department of Electrical and Computer Engineering
    ScienceinChina(SeriesF:InformationSciences), 2004, (01) : 20 - 33
  • [2] Output-threshold coupled neural network for solving the shortest path problems
    Junying Zhang
    Defeng Wang
    Meihong Shi
    Joseph Yue Wang
    Science in China Series F: Information Sciences, 2004, 47 : 20 - 33
  • [3] A Minimum Resource Neural Network Framework for Solving Multiconstraint Shortest Path Problems
    Zhang, Junying
    Zhao, Xiaoxue
    He, Xiaotao
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2014, 25 (08) : 1566 - 1582
  • [4] Solving fuzzy shortest path problems by neural networks
    Li, YZ
    Gen, M
    Ida, K
    COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 31 (3-4) : 861 - 865
  • [5] A recurrent neural network for solving the shortest path problem
    Wang, J
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1996, 43 (06): : 482 - 486
  • [6] On solving dynamic shortest path problems
    Nasrabadi, Ebrahim
    Hashemi, S. Mehdi
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 48 - 53
  • [7] SOLVING MIN-MAX SHORTEST-PATH PROBLEMS ON A NETWORK
    MURTHY, I
    HER, SS
    NAVAL RESEARCH LOGISTICS, 1992, 39 (05) : 669 - 683
  • [8] A modified pulse coupled neural network for shortest-path problem
    Wang, Xiaobin
    Qu, Hong
    Yi, Zhang
    NEUROCOMPUTING, 2009, 72 (13-15) : 3028 - 3033
  • [9] Genetic algorithms for solving shortest path problems
    Gen, M
    Cheng, RW
    Wang, DW
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 401 - 406
  • [10] An applicable method for solving the shortest path problems
    Zamirian, M.
    Farahi, M. H.
    Nazemi, A. R.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 190 (02) : 1479 - 1486