Simulation and Optimization Methodologies and Military Transportation Network Routing and Scheduling

2008 ◽  
Author(s):  
Ervin Y. Rodin ◽  
Allen McCoy
Keyword(s):  
Transportation Network ◽  
Network Routing ◽  
Routing And Scheduling ◽  
Simulation And Optimization

scholarly journals Connectivity of Semiring Valued Graphs

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1227
Author(s):  
Shyam Sundar Santra ◽  
Prabhakaran Victor ◽  
Mahadevan Chandramouleeswaran ◽  
Rami Ahmad El-Nabulsi ◽  
Khaled Mohamed Khedher ◽  
...  
Keyword(s):  
Graph Theory ◽  
Transportation Network ◽  
Dominating Set ◽  
Network Routing ◽  
Graph Connectivity ◽  
Edge Dominating Set

Graph connectivity theory is important in network implementations, transportation, network routing and network tolerance, among other things. Separation edges and vertices refer to single points of failure in a network, and so they are often sought-after. Chandramouleeswaran et al. introduced the principle of semiring valued graphs, also known as S-valued symmetry graphs, in 2015. Since then, works on S-valued symmetry graphs such as vertex dominating set, edge dominating set, regularity, etc. have been done. However, the connectivity of S-valued graphs has not been studied. Motivated by this, in this paper, the concept of connectivity in S-valued graphs has been studied. We have introduced the term vertex S-connectivity and edge S-connectivity and arrived some results for connectivity of a complete S-valued symmetry graph, S-path and S-star. Unlike the graph theory, we have observed that the inequality for connectivity κ(G)≤κ′(G)≤δ(G) holds in the case of S-valued graphs only when there is a symmetry of the graph as seen in Examples 3–5.

Complex network routing strategy based on segmented transportation distance limit

2020 ◽  
Vol 34 (27) ◽  
pp. 2050291
Author(s):  
Yuanhao Li ◽  
Xinjian Zhuo ◽  
Hui-Jia Li
Keyword(s):  
Complex Network ◽  
Transportation Network ◽  
Routing Algorithm ◽  
Network Routing ◽  
Transmission Model ◽  
Scale Free ◽  
Transmission Distance ◽  
Wide Range ◽  
And Control ◽  
Distance Limit

In transmission problem of many complex networks, there are some restrictions on the routing path between a pair of sources and destinations, especially for the transmission process that has a segment distance limit, which has a wide range of applications in real transportation, information transmission, etc. on large real networks. In this work, we constructed a complex network transmission model, defined the transmission distance limit to [Formula: see text] and randomly selected a part of the nodes in the scale-free network as the station. Based on the shortest path algorithm and a weighted routing algorithm, we observed the results under the transmission distance limit. The results show that the setting of [Formula: see text] is important, which can be used to guide and control the fuel carrying capacity of vehicles on the transportation network. Finally, we selected two real road network for simulation and the results demonstrate the effectiveness of the algorithm in scale-free networks and real networks.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document