Results 1 to 10 of about 77,474 (286)
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
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 same number of incoming and outgoing links. In this work, we establish bounds for DRGs on diameter,
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 might be longer but have other advantages, e.g., less frequent traffic congestion.
Theodoros Chondrogiannis +3 more
semanticscholar +4 more sources
The K Shortest Paths Problem with Application to Routing
, 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
+6 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
Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms [PDF]
BiomimeticsRouting and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm.
Zengkai Wang +4 more
doaj +2 more sources
Dynamic adaptive spectrum allocation in flexible grid optical network with multi‐path routing
IET Communications, 2021 Fragmentation is one of the major issues in elastic optical network (EON) due to its dynamic characteristics which may possibly degrade the spectrum efficiency.
Ujjwal Ujjwal +2 more
doaj +2 more sources
, 2015 Usual computations of alternative routes and the measure of their similarities and/or dierences do not embrace the variability of networks specics and user preferences. Indeed, the denition and evaluation of the dierence between paths is often embedded into algorithm internals and thus does not take into account that similar or dissimilar paths may ...
Grégoire Scano +2 more
openalex +3 more sources