A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
DOI10.1007/s00500-008-0313-0zbMath1175.68428OpenAlexW2022190717MaRDI QIDQ841973
Kozo Okazaki, Shan-Shan Guo, Rong-Long Wang
Publication date: 18 September 2009
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-008-0313-0
local minimumHopfield neural networkshortest path problemcombinatorial optimization problemhill-jump algorithm
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- A note on two problems in connexion with graphs
- ``Neural computation of decisions in optimization problems
- Computation of shortest path in cellular automata
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Control and optimization methods in communication network problems
- A k shortest path algorithm for adaptive routing in communications networks
- An optimal distributed routing algorithm
- Optimal Routing in a Packet-Switched Computer Network
- A Minimum Delay Routing Algorithm Using Distributed Computation
- Neurons with graded response have collective computational properties like those of two-state neurons.
- The flow deviation method: An approach to store‐and‐forward communication network design
- Routing in computer networks
- Minimum cost routing for dynamic network models
This page was built for publication: A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
