A new algorithm for finding the shortest paths using PCNNs

DOI10.1016/J.CHAOS.2006.01.097zbMath1137.90698OpenAlexW2050851711MaRDI QIDQ2477251

Hong Qu, Zhang Yi

Publication date: 13 March 2008

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2006.01.097

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (2)

A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding ⋮ Dynamic threshold P systems with delay on synapses for shortest path problems

Cites Work

• Output-threshold coupled neural network for solving the shortest path problems
• A chaos search immune algorithm with its application to neuro-fuzzy controller design
• On global stability criterion for neural networks with discrete and distributed delays
• ``Neural computation of decisions in optimization problems
• The Euclidean traveling salesman problem and a space-filling curve
• Exponential synchronization of a class of chaotic neural networks
• A columnar competitive model for solving multi-traveling salesman problem
• An new self-organizing maps strategy for solving the traveling salesman problem
• Control and optimization methods in communication network problems
• The General Pickup and Delivery Problem
• A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

This page was built for publication: A new algorithm for finding the shortest paths using PCNNs