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.

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 E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 4
Author(s):  
Bayan Alabdullah ◽  
Natalia Beloff ◽  
Martin White
Keyword(s):  
Data Storage ◽  
Statistical Tests ◽  
Data Encryption ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Security Level ◽  
Avalanche Effect ◽  
High Security Level ◽  
Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Improving the Red-Black tree delete algorithm

2021 ◽  
Author(s):  
ZEGOUR Djamel Eddine
Keyword(s):  
Data Structure ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Search Performance ◽  
Running Time ◽  
Standard Algorithm ◽  
Color Changes ◽  
Red Black Tree ◽  
Symbol Tables

Abstract Today, Red-Black trees are becoming a popular data structure typically used to implement dictionaries, associative arrays, symbol tables within some compilers (C++, Java …) and many other systems. In this paper, we present an improvement of the delete algorithm of this kind of binary search tree. The proposed algorithm is very promising since it colors differently the tree while reducing color changes by a factor of about 29%. Moreover, the maintenance operations re-establishing Red-Black tree balance properties are reduced by a factor of about 11%. As a consequence, the proposed algorithm saves about 4% on running time when insert and delete operations are used together while conserving search performance of the standard algorithm.

Cutting trajectory planning of sections with complex composition for roadheader

2018 ◽  
Vol 233 (4) ◽  
pp. 1441-1452 ◽  
Author(s):  
Suyu Wang ◽  
Miao Wu
Keyword(s):  
Trajectory Planning ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Grid Method ◽  
Ant Colony ◽  
Local Optimum ◽  
Complex Composition ◽  
Cutting Head ◽  
Pheromone Concentration ◽  
Simulation Results

In order to realize the autonomous cutting for tunneling robot, the method of cutting trajectory planning of sections with complex composition was proposed. Firstly, based on the multi-sensor parameters, the existence, the location, and size of the dirt band were determined. The roadway section environment was modeled by grid method. Secondly, according to the cutting process and tunneling cutting characteristics, the cutting trajectory ant colony algorithm was proposed. To ensure the operation safety and avoid the cutting head collision, the expanding operation was adopt for dirt band, and the aborting strategy for the ants trapped in the local optimum was put forward to strengthen the pheromone concentration of the found path. The simulation results showed that the proposed method can be used to plan the optimal cutting trajectory. The ant colony algorithm was used to search for the shortest path to avoid collision with the dirt band, and the S-path cutting was used for the left area to fulfill section forming by following complete cover principle. All the ants have found the optimal path within 50 times iteration of the algorithm, and the simulation results were better than particle swarm optimization and basic ant colony optimization.

O(log logn)-Competitive Binary Search Tree

2015 ◽  
pp. 1-4
Author(s):  
Chengwen Chris Wang ◽  
Daniel Sleator
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree
Sign in / Sign up

Export Citation Format

Share Document