Suchergebnisse - "dynamic shortest-path algorithms"

Dynamic Shortest Path Algorithms for Hypergraphs von 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 …”
Volltext

Speeding Up Dynamic Shortest-Path Algorithms von 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 …”
Volltext

SRide: An Online System for Multi-Hop Ridesharing von 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 …”
Volltext

Dynamic shortest path algorithms for hypergraphs von 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 …”
Volltext

Dynamic Shortest Path Algorithms for Hypergraphs von 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 …”
Volltext

Parallel and dynamic shortest-path algorithms for sparse graphs von 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, …”
Volltext

A dynamic shortest path algorithm based on an improved ant colony algorithm von 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 …”
Volltext

A new approach to compute minimum time path trees in FIFO time dependent networks von Grier, N., Chabini, I.

“… We consider the problem of finding one to all minimum time paths for all departure times in a FIFO time dependent network with discrete arc travel times. We …”
Volltext

Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN von 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 …”
Volltext

AHP and dynamic shortest path algorithm to improve optimum ambulance dispatch in emergency medical response von 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 …”
Volltext

A re-optimization dynamic shortest path algorithm for vehicle navigation von 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 …”
Volltext

A Dynamic Shortest Path Algorithm Using Multi-Step Ahead Link Travel Time Prediction von 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 …”
Volltext

Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue von Sunita, Deepak Garg

“… Dynamic shortest path algorithms are the ones which are used to accommodate the online sequence of update operations to the underlying graph topology and also facilitate the subsequent query operations …”
Volltext

Experimental Study of Dynamic Single-Source Shortest Path Algorithm von 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 …”
Volltext

Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2 von 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 …”
Volltext

Dynamic vehicle routing in road evacuation: route design experimentation von 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 …”
Volltext

BeeJamA: A Distributed, Self-Adaptive Vehicle Routing Guidance Approach von Wedde, Horst F., Senge, Sebastian

“… It relies on a distributed vehicle-to-infrastructure architecture. On the basis of microscopic traffic simulations under varying penetration rates, we show that BeeJamA outperforms dynamic shortest path algorithms with respect to average (global …”
Volltext

A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network von 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 …”
Volltext

A Retroactive Approach for Dynamic Shortest Path Problem von Sunita, Garg, Deepak

“… Dynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration …”
Volltext

Parallel Algorithms for Dynamic Shortest Path Problems von Chabini, Ismail, Ganugapati, Sridevi

“… The development of intelligent transportation systems (ITS) and the resulting need for the solution of a variety of dynamic traffic network models and …”
Volltext