Search Results - "dynamic shortest path algorithm"

A dynamic shortest path algorithm based on an improved ant colony algorithm by Zhang, S J

“… According to the characteristics of the traffic network, a dynamic shortest path algorithm is proposed based on an improved ant colony algorithm…”
Get full text

Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN by Akin, Erdal, Korkmaz, Turgay

“…Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a…”
Get full text

AHP and dynamic shortest path algorithm to improve optimum ambulance dispatch in emergency medical response by Laksono, Pujo, Wulan, Sri Ratna, Supangkat, Suhono Harso, Sunindyo, Wikan Danar

“… The approach used in this research is to use Analytic Hierarchy Process (AHP) that utilizes the data collected from the sources, and a dynamic shortest path algorithm…”
Get full text

A re-optimization dynamic shortest path algorithm for vehicle navigation by Jincheng Jiang, Lixin Wu

“… Both the accuracy and time performance of navigation algorithm are important. To respond rapidly to transportation network changes, this paper proposes two new dynamic shortest path algorithms based on the re-optimization method…”
Get full text

A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction by Lee, Young-Ihn, Lee, Seungjae, Lee, Shinhae, Chon, Jeunggyu

“…Route guidance systems provide motorists with step-by-step instructions on how to get from any origin to any destination in a network. The systems calculate…”
Get full text

Experimental Study of Dynamic Single-Source Shortest Path Algorithm by Xiao, Qian Cai, Li, Ming Qi, Guo, Wen Qiang

“… Based on dynamic shortest path algorithms put forward by P.Narvaez, Xiaobin et al, we analyzed the time efficiency of dynamic and static shortest path algorithms…”
Get full text

Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2 by Herberg, Ulrich

“…MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should…”
Get full text

Dynamic vehicle routing in road evacuation: route design experimentation by POLIMENI, A, VITETTA, A

“…In this paper, a shortest paths algorithm to find the paths in a time-dependent network is implemented and tested both on test and real networks. In the…”
Get full text

A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network by Zihui Zang, Wenxue Cai

“…In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object…”
Get full text

Dynamic Shortest Path Algorithms for Hypergraphs by Jianhang Gao, Qing Zhao, Wei Ren, Swami, Ananthram, Ramanathan, Ram, Bar-Noy, Amotz

“…A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in…”
Get full text

Speeding Up Dynamic Shortest-Path Algorithms by Buriol, Luciana S, Resende, Mauricio G. C, Thorup, Mikkel

“…Dynamic shortest-path algorithms update the shortest paths taking into account a change in an arc weight…”
Get full text

SRide: An Online System for Multi-Hop Ridesharing by Shah, Inayatullah, El Affendi, Mohammed, Qureshi, Basit

“…In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In…”
Get full text

Development of a cloud-based service framework for energy conservation in a sustainable intelligent transportation system by Hsu, Chia-Yu, Yang, Chin-Sheng, Yu, Liang-Chih, Lin, Chi-Fang, Yao, Hsiu-Hsen, Chen, Duan-Yu, Robert Lai, K., Chang, Pei-Chann

“…The research aims to develop a cloud-based service framework for reducing carbon dioxide emission and fuel consumption in intelligent transportation system. It…”
Get full text

Dynamic shortest path algorithms for hypergraphs by Gao, Jianhang, Zhao, Qing, Ren, Wei, Swami, Ananthram, Ramanathan, Ram, Bar-Noy, Amotz

“…A hypergraph is a set V of vertices and a set of non-empty subsets of V , called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions…”
Get full text

An efficient all-pairs approach for multi-objective dynamic shortest path problems by da Silva, Juarez Machado, Ramos, Gabriel de Oliveira, Barbosa, Jorge Luis Victória

“… This paper presents the All-pairs Multi-objective Dynamic Shortest Path algorithm, offering a novel approach that combines a labeling-correcting method with the Optimistic Linear Support algorithm…”
Get full text

Dynamic Shortest Path Algorithms for Hypergraphs by Gao, Jianhang, Zhao, Qing, Ren, Wei, Swami, Ananthram, Ramanathan, Ram, Bar-Noy, Amotz

“…A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in…”
Get full text

A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing by Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.

“…Intradomain traffic engineering aims to make more efficient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open…”
Get full text

Parallel and dynamic shortest-path algorithms for sparse graphs by Subramanian, Sairam

“…Computing single-source shortest paths is a fundamental and ubiquitous problem in network analysis. Aside from the importance of this problem in its own right,…”
Get full text

A Hybrid Genetic and Ant Colony Algorithm for Finding the Shortest Path in Dynamic Traffic Networks by Zhang, Shuijian, Zhang, Ying

“… A novel dynamic shortest path algorithm based on hybridizing genetic…”
Get full text

Improvement A Algorithm Based on Dynamic Consistency Assumption by Zhu, Ling Xiang, Zou, Liang, Zhang, Zi

“…Efficient dynamic shortest path algorithm in static networks plays an important role…”
Get full text