Results 1 to 10 of about 401,217 (210)
K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks. [PDF]
PLoS ONE, 2015 Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads.
Yunyue He +5 more
doaj +7 more sources
Entropy-Based k Shortest-Path Routing for Motorcycles: A Simulated Case Study in Jakarta [PDF]
International Journal of Advanced Computer Science and Applications, 2020 Traffic congestion is a serious problem in rapidly developing urban areas like Jakarta, Indonesia’s capital city. To avoid the congestion, motorcycles assisted with navigation apps are popular solution.
Muhamad Asvial, M. Faridz, Ajib Setyo
semanticscholar +4 more sources
IMPROVED PUBLIC TRANSIT ROUTING ALGORITHM FOR FINDING THE SHORTEST K-PATH [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2018 Most of the existing public transit routing algorithms were developed on the basis of graph theory. Recently, algorithms are being developed that can compute for O-D public transit paths by using timetable information only, not using network structure ...
I. Jeon, H. Nam, C. Jun
doaj +4 more sources
The K Shortest Paths Problem with Application to Routing [PDF]
arXiv, 2016 Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted real-world networks.
David Burstein, Leigh Metcalf
arxiv +6 more sources
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
IEEE Transactions on Parallel and Distributed Systems, 2017 The Random regular graph (RRG) has recently been proposed as an interconnect topology for future large scale data centers and HPC clusters. An RRG is a special case of directed regular graph (DRG) where each link is unidirectional and all nodes have the ...
Peyman Faizian +5 more
semanticscholar +4 more sources
Alternative routing: k-shortest paths with limited overlap [PDF]
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015 Shortest path computation is a fundamental problem in road networks with application in various domains in research and industry. However, returning only the shortest path is often not satisfying; users are also interested in alternative paths which ...
Theodoros Chondrogiannis +3 more
semanticscholar +4 more sources
Shortest Path Algorithms for Pedestrian Navigation Systems
Information, 2022 Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications are designed focusing on the requirements of motor vehicles, and therefore, finding paths in pedestrian sections of urban areas is ...
Kyriakos Koritsoglou +3 more
doaj +2 more sources
Geographic Routing in Duty-Cycled Industrial Wireless Sensor Networks With Radio Irregularity [PDF]
IEEE Access, 2016 Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged,
Lei Shu +4 more
doaj +2 more sources
An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks [PDF]
International Journal of Optics, 2014 Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of ...
Huanlin Liu, Qinren Shen, Yong Chen
doaj +3 more sources
Limited path percolation in complex networks [PDF]
Phys. Rev. Lett. 99, 188701 (2007), 2007 We study the stability of network communication after removal of $q=1-p$ links under the assumption that communication is effective only if the shortest path between nodes $i$ and $j$ after removal is shorter than $a\ell_{ij} (a\geq1)$ where $\ell_{ij}$ is the shortest path before removal.
B. Bollobás +14 more
arxiv +3 more sources