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

• Main Authors: Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina
• Format: Article
• Language: English
• Published: nstitute of Advanced Engineering and Science (IAES) 2021
• Online Access: http://psasir.upm.edu.my/id/eprint/97489/1/ABSTRACT.pdf; http://psasir.upm.edu.my/id/eprint/97489/; https://ijeecs.iaescore.com/index.php/IJEECS/article/view/26024
• Institution: Universiti Putra Malaysia

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.