.png){kind=icon}
返回
A Minimum Resource Neural Network Framework for Solving Multiconstraint Shortest Path Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2013.2293775.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e. g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than similar to 2% and 0.5% that of the Dijkstra's algorithm.
Keyword:
Autowave
minimum resource neural network (MRNN)
multiconstraint
shortest path (SP) problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
L1 syndrome diagnosis complemented with functional analysis of L1CAM variants located to the two N‐terminal Ig‐like domainsL1 综合征诊断与位于两个n端ig-like结构域的 L1CAM 变体的功能分析
PREAI
分享收藏分享收藏The Late Eocene House Range Flora, Sevier Desert, Utah: Paleoclimate and Paleoelevation.png)
PALAIOS
PALAIOSIF0
PREAI
分享收藏
查看更多内容