Results 11 to 20 of about 53,951 (279)
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
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 +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
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 +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
KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN [PDF]
International Journal of Electronics and Telecommunications, 2022 Wireless sensor network (WSN) is assortment of sensor nodes proficient in environmental information sensing, refining it and transmitting it to base station in sovereign manner.
Savita Sandeep Jadhav, Sangeeta Jadhav
doaj +1 more source
Space Efficient Edge-Fault Tolerant Routing [PDF]
, 2012 Let G be an undirected weighted graph with n vertices and m edges, and k >= 1 be an integer. We preprocess the graph in O^~(mn) time, constructing a data structure of size O^~ k deg{v}+n^{1/k}) words per vertex v in V, which is then used by our routing ...
Rajan, Varun
core +1 more source
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 +1 more source
Scientific Reports, 2021 OPC UA PubSub Over TSN is the core of the Industrial Internet and guarantees flexible interaction features for multiple parties in real-time for industrial communication.
Yan Song +4 more
doaj +1 more source
Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks [PDF]
, 2016 In this paper, we evaluate available bandwidth as a routing metric for IEEE 802.15.4-based ad-hoc networks. The available bandwidth on a data forwarding path is an approximation of the forwarding path’s residual data relaying capacity.
Brown, Kenneth N. +3 more
core +1 more source