Results 1 to 10 of about 337,837 (254)
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
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
openalex +3 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
openalex +3 more sources
Research on an intelligent routing of optical cable path based on Dueling DQN and KSP
Zhejiang dianli, 2022 Currently， the traditional method for optical cable path routing is manually decided and inefficient， leading to the slow recovery of the electric power communication business.
LU Yifei +5 more
doaj +1 more source
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
Area-Aware Routing and Spectrum Allocation for the Tidal Traffic Pattern in Metro Optical Networks
IEEE Access, 2020 With the increasing bandwidth requirements for people and the development of urbanization, the movement of the population in the city (especially the supercity) has an increasing influence on the traffic distribution in both space and time dimensions ...
Boyuan Yan +3 more
doaj +1 more source
IEEE Access, 2022 Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient spectrum use by allocating integral multiple of basic bandwidth slots (sub-channels)
Varsha Lohani +2 more
doaj +1 more source