Research on emergency rescue plan of plateau area after earthquake based on road accessibility

2020 ◽  
Author(s):  
Junming Li
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Mountainous Areas ◽  
The Road ◽  
Emergency Rescue ◽  
Dijkstra's Algorithm ◽  
Plateau Area

<p>Road damage in plateau mountainous areas has a significant impact on emergency rescue, and the size of the area where emergency rescue vehicle teams travel at different rescue stages is different, which also gives rise to different considerations of road demand. Current research finds that the respective characteristics of Dijkstra's algorithm and ant colony algorithm can meet the different needs of emergency rescue vehicle teams when they are traveling at different regional sizes. Therefore, the article simulates the earthquake and calculates the road accessibility results after the earthquake, and then considers the differences in road demand and considers the size of different regions, the Dijkstra algorithm and the ant colony algorithm are used respectively to plan the overall emergency rescue plan by setting different scenarios. The results show that the emergency rescue-planning route in different scenarios provided by the plan is scientific and reasonable, and can provide support in the research of key links.</p>

scholarly journals Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

2021 ◽  
Vol 24 (2) ◽  
pp. 1173
Author(s):  
K. Ibrahim Ata ◽  
A. Che Soh ◽  
A. J. Ishak ◽  
H. Jaafar
Keyword(s):  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Search Tree ◽  
Binary Search ◽  
Ant Colony ◽  
Binary Search Tree ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Parking System

A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. BST has been used to store the paths that Dijkstra algorithm initialled. The proposed algorithm is aimed to control the shortest path as well as guide the driver towards the nearest vacant available space near the entrance. This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. Moreover, the reason behind using the BST is to make the generation of the path by Dijkstra’s algorithm more accurate and less time performance. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm.

scholarly journals Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra

2020 ◽  
Vol 164 ◽  
pp. 10016
Author(s):  
Mikhail Urubkin ◽  
Vasiliy Galushka ◽  
Vladimir Fathi ◽  
Denis Fathi ◽  
Sofya Petrenkova
Keyword(s):  
Relational Algebra ◽  
Management Systems ◽  
Dijkstra’S Algorithm ◽  
Topical Issue ◽  
Dijkstra Algorithm ◽  
System Architectures ◽  
Dijkstra's Algorithm ◽  
Path Search ◽  
Sql Language ◽  
The Impact

The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of the Transact-SQL language. The efficiency of the known information system architectures and the impact of various ways of distributing functions between system components are reviewed. The article describes features of the relational algebra and the Transact-SQL operations, and provides a brief description of Dijkstra’s algorithm. For its programmatic implementation, several stages are defined, for each of which a formal description of the relational operations performed on it is given. The outputs of these operations are shown using the example of the database tables, and the algorithm to find the final path is given. The issues of the proposed method’s productivity and security of programmatic implementation of the path search in a graph are discussed separately.

scholarly journals Road Network Vulnerability Analysis Based on Improved Ant Colony Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Yunpeng Wang ◽  
Yuqin Feng ◽  
Wenxiang Li ◽  
William Case Fulcher ◽  
Li Zhang
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Critical Infrastructures ◽  
Traffic Demand ◽  
The Road ◽  
Utility Index ◽  
Decision Supporting ◽  
Improved Ant Colony Algorithm

We present an improved ant colony algorithm-based approach to assess the vulnerability of a road network and identify the critical infrastructures. This approach improves computational efficiency and allows for its applications in large-scale road networks. This research involves defining the vulnerability conception, modeling the traffic utility index and the vulnerability of the road network, and identifying the critical infrastructures of the road network. We apply the approach to a simple test road network and a real road network to verify the methodology. The results show that vulnerability is directly related to traffic demand and increases significantly when the demand approaches capacity. The proposed approach reduces the computational burden and may be applied in large-scale road network analysis. It can be used as a decision-supporting tool for identifying critical infrastructures in transportation planning and management.

scholarly journals City Delivery Routes Planning Based on the Ant Colony Algorithm

2020 ◽  
Vol 19 (4) ◽  
pp. 356-362
Author(s):  
M. Olkhova ◽  
D. Roslavtsev ◽  
O. Matviichuk ◽  
A. Mykhalenko
Keyword(s):  
Ant Colony Algorithm ◽  
Working Hours ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
The Road ◽  
Load Matching ◽  
Software Products ◽  
Logistics Service ◽  
Road Congestion ◽  
Delivery Routes

For any company that sells its products in the networks of city stores, the urgent issue is the optimal delivery of their goods. During routing it is necessary to take into account many restrictions caused by specific conditions of transportation process in the city: number of cargoes, nature of cargoes, delivery time, structure of fleet and its presence, work time of enterprises for load matching, drivers’ working hours, loading capacity, road congestion etc. These days, the process of efficient manual routing is difficult because of many restrictions and delivery points wherein it is almost impossible to take into account the road congestion for specific routes. Today's companies are increasingly interested in outsourcing. One of the options for routes planning for enterprises is to use special software products that allow to plan optimal routes according to the chosen criteria and under specific conditions. The process of formation of routes using the Ant Logistics service, based on the Ant Colony optimization algorithm are analysed in the paper. Comparing the two options of forming routes to serve one of the largest retail chains in Kharkiv with the application of Ant Logistics service, it has been elucidated that the application of Ant Colony algorithm is more optimal than the Clarke-Wright algorithm based on delivery routes indicators.

scholarly journals APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH

2021 ◽  
Vol 10 (3) ◽  
pp. 173
Author(s):  
RENDI SAPUTRAMA ◽  
HARTATIANA HARTATIANA
Keyword(s):  
Graph Theory ◽  
Directed Graph ◽  
Applied Research ◽  
Dijkstra’S Algorithm ◽  
The Road ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Starting Point ◽  
Route Option

Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application of graph theory by using Dijkstra's Algorithm becomes a solution for this problem. This algorithm has the advantage to minimize the expense of the costs by finding the shortest route from starting point to the destination. This study is applied research. The study will discuss the determination of the origin and destination end-point, traverse route, the calculation of the weight distance, analyzes the Dijkstra's iteration to determine the shortest route, and conclusion. As the result, the land route becomes the shortest route option from UIN Raden Fatah Campus A to B. The directed graph of the route represents the location as point, the road as the side, and distance as weight. The result shows that the route distance is 6.94 km using Dijkstra's Algorithm.

scholarly journals The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

2021 ◽  
Vol 348 ◽  
pp. 01001
Author(s):  
Paryati ◽  
Krit Salahddine
Keyword(s):  
Shortest Path ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Application System ◽  
Path Creation ◽  
Dijkstra's Algorithm

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

Application of Emergency Logistics Distribution Routing Optimization Based on Improved Ant Colony Algorithm

2011 ◽  
Vol 268-270 ◽  
pp. 1726-1732 ◽  
Author(s):  
Li Yi Zhang ◽  
Teng Fei ◽  
Jin Zhang ◽  
Jie Li
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Delivery Time ◽  
Emergency Relief ◽  
Logistics Distribution ◽  
The Road ◽  
Routing Optimization ◽  
Emergency Logistics ◽  
Improved Ant Colony Algorithm

Emergency relief has characteristics of complexity, urgency, sustainability, technicality, and so on. In this paper a mathematical model to seek the shortest delivery time as the ultimate goal is established based on these characteristics, which is on the core of characteristics with the urgency and consider both the road conditions and on shortage of demand point of relief supplies. The problem of emergency logistics distribution routing optimization is solved by the improved ant colony algorithm—Fish-Swarm Ant Colony Optimization (FSACO), simulation results show that, compared with basic ant colony algorithm, Fish-Swarm Ant Colony Optimization can find the higher quality to solve the problem of emergency logistics distribution routing optimization.

Obstacle Avoidance Path Planning for Harvesting Robot Manipulator Based on MAKLINK Graph and Improved Ant Colony Algorithm

2014 ◽  
Vol 530-531 ◽  
pp. 1063-1067 ◽  
Author(s):  
Wei Ji ◽  
Jun Le Li ◽  
De An Zhao ◽  
Yang Jun
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Ant Colony Algorithm ◽  
Robot Manipulator ◽  
Ant Colony ◽  
Dijkstra Algorithm ◽  
Short Time ◽  
Vector Description ◽  
Harvesting Robot ◽  
Improved Ant Colony Algorithm

To the problems of real-time obstacle avoidance path planning for apple harvesting robot manipulator in dynamic and unstructured environment, a method based on improved ant colony algorithm is presented. Firstly, Vector description is utilized to describe the area where obstacles such as branches is located as irregular polygon in free space, and MAKLINK graph is used to build up the environment space model. Then, the improved Dijkstra algorithm is used to find the initial walk path for apple harvesting robot manipulator. Finally, the improved ant colony algorithm is applied to optimize the initial path. The experiment result shows that the proposed method is simple and the robot manipulator can avoid the branches to pick the apple successfully in a relatively short time.

Research on the Shortest Path of Mine Emergency Rescue Based on Path Weight Adaptive Ant Colony Algorithm

2011 ◽  
Vol 88-89 ◽  
pp. 302-306 ◽  
Author(s):  
Kai Wang ◽  
Shu Guang Jiang ◽  
Zheng Yan Wu ◽  
Wei Zou
Keyword(s):  
Shortest Path ◽  
Coal Mine ◽  
Ant Colony Algorithm ◽  
Influential Factors ◽  
Ant Colony ◽  
Analytic Hierarchy ◽  
Emergency Rescue ◽  
Equivalent Length ◽  
Rescue System ◽  
Hierarchy Process

Finding the shortest path is an important issue of coal mine emergency rescue. In this paper, based on Analytic Hierarchy Process theory, the roadway path weight is calculated, thus, influential factors weight on walking speed by roadway attribute is obtained. The establishment of the roadway equivalent length system constitutes roadway equivalent length adjacency matrix combined with path weight. Using adaptive ant colony algorithm and MATLAB software to simulate local roadway of a coal mine domestic, we get the shortest path in mine emergency rescue system, which is more reasonable and less time needed.

Sign in / Sign up

Export Citation Format

Share Document