Results 1 to 10 of about 28,519 (274)
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 +6 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. However, the existing navigation apps do not take into account traffic data. This paper proposes an open-source navigation app for motorcycle by taking
Muhamad Asvial, M. Faridz, Ajib Setyo
semanticscholar +3 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
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016 Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming ...
Peyman Faizian +4 more
semanticscholar +4 more sources
The K Shortest Paths Problem with Application to Routing [PDF]
, 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
openalex +3 more sources
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.
Chondrogiannis, Theodoros +3 more
openaire +3 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
A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes
Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI)The top-k shortest path problem is a fundamental topic in graph theory and pathfinding applications. Traditional approaches focus solely on finding k paths with the least total cost or distance, often resulting in highly similar paths that offer limited flexibility for user selection.
Bagus Jati Santoso +2 more
openalex +3 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