A modified pulse coupled neural network for shortest-path problem

Authors:
Xiaobin Wang;Hong Qu;Zhang Yi
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, PR China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, PR China;School of Computer Science, SiChuan University, Chengdu, China
Venue:
Neurocomputing
Year:
2009

Citing 19
Cited 6

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)
Algorithm 97: Shortest path

Communications of the ACM
Understanding and Restructuring Web Sites with ReWeb

IEEE MultiMedia
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees

LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Destination-driven shortest path tree algorithms

Journal of High Speed Networks
Finding the shortest path in stochastic networks

Computers & Mathematics with Applications
Feature linking via synchronization among distributed assemblies: Simulations of results from cat visual cortex

Neural Computation
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Computers & Mathematics with Applications
Shortest paths in stochastic networks with correlated link costs

Computers & Mathematics with Applications
A genetic algorithm for shortest path routing problem and the sizing of populations

IEEE Transactions on Evolutionary Computation
Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Genetic Algorithms for Route Discovery

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Finding the shortest path in the shortest time using PCNN's

IEEE Transactions on Neural Networks
Object detection using pulse coupled neural networks

IEEE Transactions on Neural Networks
A columnar competitive model for solving combinatorial optimization problems

IEEE Transactions on Neural Networks

A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network

Digital Signal Processing
Feedforward networks based straightforward hierarchical routing in solar powered wireless sensor networks

WSEAS TRANSACTIONS on COMMUNICATIONS
A novel neural network method for shortest path tree computation

Applied Soft Computing
A proposed PCNN features quality optimization technique for pose-invariant 3D Arabic sign language recognition

Applied Soft Computing
A Neural-network Algorithm for All k Shortest Paths Problem

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Optimizing urban traffic flow using Genetic Algorithm with Petri net analysis as fitness function

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Shortest-path problem is well-known optimization problem and has been studied by many authors in recent years. Typically it is solved by using the famous Dijkstra's algorithm, which would quickly provide a global optimization solution in most instances. However, as the problem scale increases, this method is inefficient and may consume a considerable amount of CPU time. Neural networks, which are massively parallel models, can solve this question easily. This paper presents a novel biological neural network based algorithm for the finding of the shortest path in large scale systems. The start neuron fires first, and then the firing event spreads out through the lateral connections among the neurons, like the propagation of a wave. Then the generated spiking wave spreads at a constant speed so that the time of travel between two neurons is proportional to the path length between them. The computational complexity of the algorithm is only related to the length of the shortest path, and independent of the number of existing paths in the graph. Simulation results show that the proposed method is more efficient than Dijkstra's in the larger scale systems.