Výsledky vyhľadávania - dynamic shortest path algorithm

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

“… In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes…”
Získať plný text

Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model Autor Wei, Haitao, Zhang, Shusheng, He, Xiaohui

“… Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability…”
Získať plný text

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

“… In this paper, the shortcomings of classical shortest path algorithms in solving the dynamic shortest path problem are analyzed…”
Získať plný text

A decremental approach with the A∗ algorithm for speeding-up the optimization process in dynamic shortest path problems Autor Ardakani, Mostafa K., Tavana, Madjid

“…•We study speeding-up the shortest path in continuous-time dynamic networks.•Decremental A∗ algorithm is proposed to reduce network size and speed-up optimization…”
Získať plný text

A dynamic ripple-spreading algorithm for solving mean–variance of shortest path model in uncertain random networks Autor Jie, Ke-Wei, Liu, San-Yang, Sun, Xiao-Jun, Xu, Yun-Cheng

“… This paper considers a shortest path problem where arc costs include both uncertainty and randomness, and the decision-maker wishes to minimize both the expected cost and the variance of this cost. Firstly, a mean…”
Získať plný text

Decision model of public opinion risk in campus social network based on hybrid dynamic deletion and shortest path algorithm Autor Xu, Nan, Wang, Yifeng

“… The research results show that the average precision rate, recall rate, and F-value of the dynamic deletion-shortest path algorithm are 97.30%, 79.55%, and 87.53…”
Získať plný text

A parallel all-pairs shortest paths algorithm for dynamic graphs Autor Zhu, Lin, Hua, Qiang-sheng, Jin, Hai

Získať plný text

Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies Autor Monakhov, Oleg G., Monakhova, Emilia A., Romanov, Aleksandr Yu, Sukhov, Andrej M., Lezhnev, Evgenii V.

“…) at the nodes and channels of the communication network. A distinctive feature of the proposed algorithm is the absence of using the routing tables with fixed shortest paths when message is transmitted…”
Získať plný text

A multiphase dynamic programming algorithm for the shortest path problem with resource constraints Autor Himmich, Ilyas, El Hallaoui, Issmail, Soumis, François

“…The shortest path problem with resource constraints (SPPRC) finds a least cost path between two nodes in a network while respecting constraints on resource consumption…”
Získať plný text

Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks Autor Shovan, S. M., Khanda, Arindam, Das, Sajal K.

“… Efficiently updating the shortest path in such networks is challenging, and existing algorithms for static graphs are inadequate for these dynamic conditions, necessitating novel approaches…”
Získať plný text

A single-source shortest path algorithm for dynamic graphs Autor Alshammari, Muteb, Rezgui, Abdelmounaam

“… Examples include social networks, communication networks, transportation networks, etc. One of the most challenging problems in large scale dynamic graphs is the single-source shortest path (SSSP) problem…”
Získať plný text

An Efficient Maintenance Algorithm for Shortest Path Tree in Dynamic Network Autor WEI Yuke,WANG Shouxiang

“…The reported Dynamic Shortest Path Tree(DSPT) algorithm can result in frequent update of the Shortest Path Tree(SPT…”
Získať plný text

Speeding Up Dynamic Shortest-Path Algorithms Autor 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…”
Získať plný text

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

“…Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS…”
Získať plný text

Optimal Design of a Wide Area Measurement System for Improvement of Power Network Monitoring Using a Dynamic Multiobjective Shortest Path Algorithm Autor Ghasemkhani, Amir, Monsef, Hassan, Rahimi-Kian, Ashkan, Anvari-Moghaddam, Amjad

“…) solution methodology while taking into account zero-injection bus effects. In the next step, new dynamic multiobjective shortest path (MOSP…”
Získať plný text

Dynamic-Area-Based Shortest-Path Algorithm for Intelligent Charging Guidance of Electric Vehicles Autor Cai, Junpeng, Chen, Dewang, Jiang, Shixiong, Pan, Weijing

“…’ travel demand intelligently. In the dynamic area, the Dijkstra algorithm is used to find the charging station with the shortest trip…”
Získať plný text

Implementing Efficient Dynamic Threat Avoidance Routing Based on Dijkstra's Shortest Path Algorithm in the Advanced Framework for Simulation, Integration, and Modeling (AFSIM) Autor Reid, Dante C., Champagne, Lance E., Gaw, Nathan B.

“…Simulating pre-planned routes and dynamic threat avoidance routing represents a significant problem for operations analysts…”
Získať plný text

A Dynamic Shortest Travel Time Path Planning Algorithm with an Overtaking Function Based on VANET Autor Li, Chunxiao, Fan, Changhao, Wang, Mu, Shen, Jiajun, Liu, Jiang

“… In order to find an optimal route and arrive at the destination with the shortest travel time, this paper proposes a dynamic shortest travel time path planning algorithm with an overtaking function (DSTTPP…”
Získať plný text

Solving Minimum Steiner Tree on Grid using Dynamic Programming and Shortest Path First Algorithm Autor Soelaiman, Rully, D'Layla, Adifa Widyadhani Chanda, Rizkynanda, Achmad Nashruddin, Purwananto, Yudhi

“… This paper explores the application of the Shortest Path Faster Algorithm (SPFA) to effectively solve the Minimum Steiner Tree problem, particularly in the context of the E-Olymp problem 1445-Road Network…”
Získať plný text

A loop-free shortest-path routing algorithm for dynamic networks Autor DʼAngelo, Gianlorenzo, DʼEmidio, Mattia, Frigioni, Daniele

“…This work introduces Loop-Free Routing (LFR), a new loop-free distance-vector routing algorithm, which is able to update the shortest paths of a distributed network in fully dynamic scenarios…”
Získať plný text