An efficient and shortest path selection primary-segmented backup algorithm for real-time communication in multi-hop networks

2013 ◽  
Author(s):  
S. Pandey ◽  
R.K. Pandey
Keyword(s):  
Real Time ◽  
Shortest Path ◽  
Path Selection

scholarly journals Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Zhi-ying Xie ◽  
Yuan-Rong He ◽  
Yuan-tong Jiang ◽  
Chih-Cheng Chen
Keyword(s):  
Dynamic Programming ◽  
Real Time ◽  
Shortest Path ◽  
Search Algorithm ◽  
Path Selection ◽  
Vehicle Guidance ◽  
Tree Model ◽  
Trip Time ◽  
Probability Tree ◽  
On The Road

Real-time vehicle guidance effectively reduces traffic jams and improves the operational efficiency of urban transportation. The trip time on a route is considered as a random process that changes with time, and the shortest path selection requires a random dynamic model and the solution of a decision-making problem. Thus, the shortest trip time is the criterion to determine the dynamic path selection by a random dynamic programming (DP) model which discretizes the trip times in the continuous segments on the route. In this study, a numerical model of random dynamic programming is established by using a probability tree model and an AND/OR (AO∗) algorithm to select the path of the shortest trip time. The results show that the branches of the probability tree are only accumulated on the “quantity” and do not cause a “qualitative” change. The inefficient accumulation of “quantity” affects the efficiency of the algorithm, so it is important to separate the accumulation of “quantity” from node expansion. The accumulation of “quantity” changes the trip time according to the entering time into a segment, which demands an improved AO∗ algorithm. The new AO∗ algorithm balances between efficiency and the trip time and provides the optimal real-time vehicle guidance on the road.

Path Selection for Real-Time Communication on Priority-Aware NoCs

2016 ◽  
Vol 21 (3) ◽  
pp. 1-25
Author(s):  
Hany Kashif ◽  
Hiren Patel ◽  
Sebastian Fischmeister
Keyword(s):  
Real Time ◽  
Path Selection ◽  
Selection For

Travelling and Steering Path Adjustment of Blueberry Harvesters

2011 ◽  
Vol 486 ◽  
pp. 25-28
Author(s):  
Zhi Peng Li ◽  
Dong Sheng Li
Keyword(s):  
Control System ◽  
Path Planning ◽  
Real Time ◽  
System Development ◽  
Path Selection ◽  
Ant Colony ◽  
New Knowledge ◽  
Knowledge Support ◽  
Virtual Modeling ◽  
Adjustment System

A picking and steering adjustment system for blueberry harvesters has been developed. In this paper, the main hardware and working principles of the system is introduced first, then the application of an ant colony simplification algorithm in the system development is presented. Information of virtual modeling the blueberry plant images and fruit distributions is obtained through the control system which is used as input for the ant colony simplification algorithm calculation. Then results are translated into real-time travelling path planning instructions for the blueberry harvester. The research provided technological and new knowledge support for future investigations into intelligent travelling path selection, thus playing an important role in mechanization and intelligent harvesting processes for blueberry harvesters.

Note on “Optimal path selection approach for fuzzy reliable shortest path problem”

2020 ◽  
Vol 39 (5) ◽  
pp. 7653-7656
Author(s):  
Ranjan Kumar ◽  
SA Edalatpanah ◽  
Hitesh Mohapatra
Keyword(s):  
Shortest Path ◽  
Fuzzy Systems ◽  
Optimal Path ◽  
Vital Role ◽  
Path Selection ◽  
Shortest Path Problem ◽  
Shortest Path Problems ◽  
Fuzzy Environment ◽  
Selection Approach ◽  
Arc Lengths

There are different conditions where SPP play a vital role. However, there are various conditions, where we have to face with uncertain parameters such as variation of cost, time and so on. So to remove this uncertainty, Yang et al. [1] “[Journal of Intelligent & Fuzzy Systems, 32(1), 197-205”] have proposed the fuzzy reliable shortest path problem under mixed fuzzy environment and claimed that it is better to use their proposed method as compared to the existing method i.e., “[Hassanzadeh et al.; A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths, Mathematical and Computer Modeling, 57(2013) 84-99” [2]]. The aim of this note is, to highlight the shortcoming that is carried out in Yang et al. [1] article. They have used some mathematical incorrect assumptions under the mixed fuzzy domain, which is not true in a fuzzy environment.

scholarly journals Routing Optimization Algorithms Based on Node Compression in Big Data Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Lifeng Yang ◽  
Liangming Chen ◽  
Ningwei Wang ◽  
Zhifang Liao
Keyword(s):  
Big Data ◽  
Shortest Path ◽  
Optimization Algorithms ◽  
Real Life ◽  
Large Data ◽  
Path Selection ◽  
Shortest Path Problem ◽  
Limited Time ◽  
Starting Point ◽  
Data Environment

Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given; but the researches of shortest path on a limited time and limited nodes passing through are few, yet such problem could not be more common in real life. In this paper we propose several time-dependent optimization algorithms for this problem. In regard to traditional backtracking and different node compression methods, we first propose an improved backtracking algorithm for one condition in big data environment and three types of optimization algorithms based on node compression involving large data, in order to realize the path selection from the starting point through a given set of nodes to reach the end within a limited time. Consequently, problems involving different data volume and complexity of network structure can be solved with the appropriate algorithm adopted.

A path selection-based algorithm for real-time data staging in Grid applications

2005 ◽  
Vol 65 (11) ◽  
pp. 1318-1328 ◽  
Author(s):  
Mohammed Eltayeb ◽  
Atakan Doğan ◽  
Füsun Özgüner
Keyword(s):  
Real Time ◽  
Path Selection ◽  
Time Data ◽  
Data Staging ◽  
Real Time Data ◽  
Grid Applications

Extended shortest path selection for package routing of complex networks

2017 ◽  
Vol 28 (11) ◽  
pp. 1750129 ◽  
Author(s):  
Fan Ye ◽  
Lei Zhang ◽  
Bing-Hong Wang ◽  
Lu Liu ◽  
Xing-Yi Zhang
Keyword(s):  
Complex Networks ◽  
Shortest Path ◽  
Network Flow ◽  
Path Selection ◽  
Local Load ◽  
Maximum Throughput ◽  
Distance Analysis ◽  
Routing Optimization ◽  
Routing Strategy ◽  
Peer To Peer Networks

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Sign in / Sign up

Export Citation Format

Share Document