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.

A Simplified Real-Time Road Network Model Considering Intersection Delay and its Application on Vehicle Navigation

2011 ◽  
Vol 58-60 ◽  
pp. 1959-1965 ◽  
Author(s):  
Zheng Yu Zhu ◽  
Wei Liu ◽  
Lin Liu ◽  
Ming Cui ◽  
Jin Yan Li
Keyword(s):  
Real Time ◽  
Network Model ◽  
Road Network ◽  
Intelligent Transportation System ◽  
Optimal Path ◽  
Network Models ◽  
Traffic Information ◽  
Vehicle Navigation ◽  
Traffic Data ◽  
New Model

The complexity of a real road network structure of a city and the variability of its real traffic information make a city’s intelligent transportation system (ITS) hard to meet the needs of the city’s vehicle navigation. This paper has proposed a simplified real-time road network model which can take into account the influence of intersection delay on the guidance for vehicles but avoid the calculation of intersection delay and troublesome collection of a city’s traffic data. Based on the new model, a navigation system has been presented, which can plan a dynamic optimal path for a vehicle according to the real-time traffic data received periodically from the city’s traffic center. A simulated experiment has been given. Compared with previous real-time road network models, the new model is much simpler and more effective on the calculation of vehicle navigation.

scholarly journals Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

2014 ◽  
Vol XL-8 ◽  
pp. 1105-1114 ◽  
Author(s):  
S. Dutta ◽  
D. Patra ◽  
H. Shankar ◽  
P. Alok Verma
Keyword(s):  
Spanning Tree ◽  
Road Network ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Transportation Network ◽  
Travelling Salesman Problem ◽  
Optimal Path ◽  
Road Transportation ◽  
Gis Technology ◽  
Weighted Network

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim’s algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it’s minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.

scholarly journals Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America

2019 ◽  
pp. 1394-1403
Author(s):  
Mohammed S. Ibrahim
Keyword(s):  
Shortest Path ◽  
Transportation Network ◽  
Optimal Path ◽  
Path Model ◽  
Multi Objective ◽  
Proposed Model ◽  
Shortest Distance ◽  
Lexicographic Method ◽  
Package Program ◽  
Us Cities

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operational research applications.

Based on the Research of Simulation System of City Traffic Model

2013 ◽  
Vol 361-363 ◽  
pp. 2262-2265
Author(s):  
Pan Li He ◽  
Xin Xiao Dai ◽  
Xiao Wei Han
Keyword(s):  
Travel Time ◽  
Network Model ◽  
Road Network ◽  
Optimal Path ◽  
Major Elements ◽  
Simulation System ◽  
Traffic Model ◽  
Urban Network ◽  
Optimal Path Planning ◽  
Link Travel Time

In this paper, according to three major elements of road network "the collection of nodes, sections and the weight of road, established a combination model of static and dynamic of urban network based on graph theory. The model used the shortest travel time as the objective function for optimal path planning, focused on the analysis of link travel time, travel time is divided into free travel time of sections and intersection delay time to discuss and study. Finally, the Floyd algorithm was used to simulate this network model, in order to prove the effectiveness of the network model.

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.

scholarly journals An enhanced routing algorithm using ant colony optimization and VANET infrastructure

2019 ◽  
Vol 259 ◽  
pp. 02009 ◽  
Author(s):  
Noussaiba Melaouene ◽  
Rahal Romadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Road Network ◽  
Intelligent Transportation System ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Intelligent Transportation ◽  
Transportation System ◽  
Ant Colony ◽  
Specific Time

For the last fifty years, finding efficient vehicle routes has been studied as a representative logistics problem. In the transportation field, finding the shortest path in a road network is a common problem. VANET presents an innovation opportunity in the transportation field that enables services for intelligent transportation system (ITS) especially communication features. Because of VANET features [1] and despite road obstacles, a route for the shortest path can be established at a given moment. This paper proposes an enhanced algorithm, based on ACO Ant Colony Optimization and related to VANET infrastructure that aims to find the shortest path from the source to destination through the optimal path; in addition, a storage on static nodes is installed in each intersection in a VANET environment and for a specific time.

scholarly journals Optimal Route Computation for Public Transport with Minimum Travelling Time & Travel Cost: A Case Study of Pokhara City

2019 ◽  
Vol 1 (1) ◽  
pp. 79-86
Author(s):  
R. Thapa ◽  
J.K. Shrestha
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Public Transportation ◽  
Transportation Network ◽  
Optimal Path ◽  
Travel Cost ◽  
Transit Network ◽  
Final Destination ◽  
Travelling Time

In road networks, it is imperative to discover a shortest way to reach the final destination. When an individual is new to a place, lots of time is wasted in finding the destination. With the advancement of technology, various navigation applications have been developed for guiding private vehicles, but few are designed for public transportation. This study is solely concentrated on finding the possible shortest path in terms of minimum time and cost to reach specific destination for an individual. It requires an appropriate algorithm to search the shortest path. With the implementation of Dijkstra’s algorithm, the shortest path with respect to minimum travel time and travel cost was computed. Public transportation network of Pokhara city was taken for the case study of this research. The results of this analysis indicated that when the “time” impedance was used by the algorithm, it generated the shortest path between the origin and destination along with the path to be followed. This study formulates a framework for generating itinerary for passengers in a transit network that allows the user to find the optimal path with minimum travel time and cost.

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.

Sign in / Sign up

Export Citation Format

Share Document