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 +4 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
openalex +2 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 +2 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
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
IEEE Transactions on Parallel and Distributed Systems, 2017 Peyman Faizian +5 more
openalex +2 more sources
Traffic Scheduling Method for Time-Sensitive Network [PDF]
Jisuanji gongcheng, 2021 Traditional time-sensitive traffic scheduling methods are generally limited by low calculation efficiency and slow iteration convergence.To implement efficient traffic routing scheduling and calculation,a traffic scheduling method based on load balancing
CAO Zhipeng, LIU Qinrang, LIU Dongpei, ZHANG Xia
doaj +1 more source
A Literature review on finding the K Shortest Path using Dynamic Route Guidance Systems
, 2016 Ashok Kuppusamy, K. Yuvaraj
openalex +3 more sources
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Jisuanji gongcheng, 2020 Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source