scholarly journals Comparative Evaluation of Path Finding in All Pair Shortest Path Problem for Airline Network

2020 ◽  
Vol 55 (4) ◽  
Author(s):  
Nadia Moqbel Hassan Al-Zubaydi
Keyword(s):  
Shortest Path ◽  
Comparative Evaluation ◽  
Transportation Networks ◽  
Transportation Network ◽  
Network Routing ◽  
Path Selection ◽  
Aircraft Routing ◽  
Efficient Performance ◽  
Airline Network ◽  
Selection Of

In the field of geoformation and transportation science, the shortest path is calculated on graph mostly found in road and transportation networks, especially the network of airports of some capitals around the globe. Against this backdrop, the present paper follows Geographic Information Systems to investigate the real distance for the airline in order to achieve an optimal aircraft routing within a dynamically stochastic transportation network. Routing is a procedure of forwarding the data from a known seed to the goal in which the data may travel through several intermediate routes. Consequently, the selection of the best possible shortest path nodes to forward the data using all pair shortest path is necessitated. Moreover, as a result of this approach, this shortest path selection of nodes will help facilitate the attainment of an efficient performance in the network. Copious amounts of work have been carried out to discover the shortest path in the network routing for the purpose of improving its efficiency and overcoming possible problems.

AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS

2021 ◽  
Vol 12 (1) ◽  
pp. 36-48
Author(s):  
Arjun Jadhaw ◽  
◽  
Vikrant Sharma
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Network Routing ◽  
Path Selection ◽  
Network Simulator ◽  
Hop Count ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Selection Of

Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.

Reaching “the Southern Wilderness”: Expansion and the Formation of the Lingnan Transportation Network during the Qin and Han Dynasties

2019 ◽  
Vol 63 (1-2) ◽  
pp. 157-194
Author(s):  
Michèle H.S. Demandt
Keyword(s):  
Hot Spots ◽  
Transportation Networks ◽  
Transportation Network ◽  
Urban Landscapes ◽  
The South ◽  
Selection Of

AbstractThis article will focus on the incorporation of the Lingnan region into the territory of the Qin and Han Empire and will provide a deeper exploration of the role of “transportation networks” in expansionist politics and its effect on local socioeconomics. Through the study of historical and archaeological categories of evidence, the formation of the Lingnan transportation network and the specifics of Qin-Han frontier politics in the south will be discussed. It is argued that expansion and transport building were inspired by the same determinants, and transformed a selection of traffic “hot-spots” into socially-complex urban landscapes.

scholarly journals Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 203
Author(s):  
Haitao Wei ◽  
Shusheng Zhang ◽  
Xiaohui He
Keyword(s):  
Network Model ◽  
Shortest Path ◽  
Road Network ◽  
Transportation Network ◽  
Optimal Path ◽  
Network Routing ◽  
Navigation Systems ◽  
Search Performance ◽  
Statistical Parameters ◽  
The Real

Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. 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 still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution.

Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach

1997 ◽  
Vol 1607 (1) ◽  
pp. 31-37 ◽  
Author(s):  
Dongjoo Park ◽  
Laurence R. Rilett
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Heuristic Algorithms ◽  
Transportation Networks ◽  
Multiple Criteria Decision Making ◽  
Path Selection ◽  
Multiple Criteria ◽  
Transportation Engineering ◽  
Shortest Path Algorithm ◽  
Shortest Path Algorithms

A fundamental component of many transportation engineering applications is the identification of the route between a given origin and destination. Typically, some type of shortest-path algorithm is used for this task. However, shortest-path algorithms are only applicable when a single criterion, such as minimizing travel time, is used for path selection. When multiple criteria, such as the mean and variance of travel time, are used for path selection, then alternative-path identification methods must be found. The present objective is to develop an algorithm that can identify multiple and reasonable routes in transportation networks so that multiple-criteria decision-making techniques can be used in route selection. First, the definitions of single and multiple routes from a transportation engineering perspective are examined. It is indicated that although the traditional k-shortest-path algorithms can find routes with similar route travel times, the routes may be too similar with respect to the links used and consequently are not appropriate for certain transportation applications. A definition of a reasonable path is developed on the basis of transportation engineering rather than purely mathematical considerations. Two k-reasonable-path algorithms are then illustrated. These algorithms can be used to identify multiple and reasonable routes in transportation networks. Lastly, the two heuristic algorithms were tested on a network from Bryan to College Station, Texas, and the results were compared with the results obtained with a traditional k-shortest-path algorithm. It was found that the reasonable-path algorithms can identify routes that are similar in route travel time but significantly different in terms of the links used.

scholarly journals The shortest path algorithm performance comparison in graph and relational database on a transportation network

2014 ◽  
Vol 26 (1) ◽  
pp. 75-82 ◽  
Author(s):  
Mario Miler ◽  
Damir Medak ◽  
Dražen Odobašić
Keyword(s):  
Shortest Path ◽  
Road Network ◽  
Transportation Networks ◽  
Transportation Network ◽  
Database Systems ◽  
Performance Comparison ◽  
Graph Database ◽  
Shortest Path Algorithm ◽  
Algorithm Performance ◽  
Path Calculation

In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting) and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

Study on Path Selection of Emergency Rescue Based on GIS

2013 ◽  
Vol 864-867 ◽  
pp. 2804-2807 ◽  
Author(s):  
Hai Long Sun ◽  
Li Yan Yue ◽  
Sheng Yong Yao
Keyword(s):  
Transportation Network ◽  
Path Selection ◽  
Route Optimization ◽  
Ant Algorithm ◽  
Dynamic Vehicle Routing ◽  
Emergency Rescue ◽  
Routing Optimization ◽  
Urban Disaster ◽  
Vehicle Routing Optimization ◽  
Selection Of

In the process of urban disaster emergency rescue, vehicle route optimization has become a key problem of city emergency rescue. In order to improve the emergency rescue responsiveness, a dynamic vehicle routing optimization model is established, which takes dynamic transportation network as the research object and travel time as the goal. At the same time, an improved ant algorithm is used to solve the model, which achieves the desired objectives.

Use of photodynamic therapy for photodamage skin (review of literature)

2019 ◽  
Vol 1 (7) ◽  
pp. 19-23
Author(s):  
S. I. Surkichin ◽  
N. V. Gryazeva ◽  
L. S. Kholupova ◽  
N. V. Bochkova
Keyword(s):  
Photodynamic Therapy ◽  
Comparative Evaluation ◽  
Clinical Manifestations ◽  
Light Sources ◽  
Review Of Literature ◽  
Photosensitizing Agents ◽  
Selection Of

The article provides an overview of the use of photodynamic therapy for photodamage of the skin. The causes, pathogenesis and clinical manifestations of skin photodamage are considered. The definition, principle of action of photodynamic therapy, including the sources of light used, the classification of photosensitizers and their main characteristics are given. Analyzed studies that show the effectiveness and comparative evaluation in the selection of various light sources and photosensitizing agents for photodynamic therapy in patients with clinical manifestations of photodamage.

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Sign in / Sign up

Export Citation Format

Share Document