Proceedings of International Conference on Applied Innovation in IT
2025/04/26, Volume 13, Issue 1, pp.17-25

Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection


Oleksandra Yaroshevska and Veronika Kirova


Abstract: The article considers the possibilities of using the Ant Colony Optimization algorithm to find the shortest path in the network based on the selected criteria. Its performance is compared to Dijkstra's algorithm and LCA algorithm, which is widely used in different network routing protocols. An overview of the ACO algorithm, including its two primary components, the "ant" and "pheromone," is provided, highlighting its efficiency for the optimal network path selection. Detailed schemes, parameters and formulas of the ACO algorithm implementation in terms of networking are shown. A comparative analysis of the performance and execution time of the ACO and two compared algorithms for the optimal network path based on Round Trip Time criteria in networks of varying scale, ranging from small to highly branched networks with thousands of nodes, is discussed. Finally, the results are analysed, and the potential for ACO to serve as a complementary algorithm to Dijkstra's and LCA in future network applications is explored.

Keywords: Network Optimal Path, Ant Colony Optimization (ACO) Algorithm, Dijkstra’s Algorithm, Lowest Common Ancestor (LCA), Pheromone, RTT, Python.

DOI: Under Indexing

Download: PDF

References:

  1. X. Liu, Y.-L. Chen, L. Y. Por, and C. Ku, "A Systematic Literature Review of Vehicle Routing Problems with Time Windows," Sustainability, vol. 15, 08 2023, [Online]. Available: https://doi.org/10.3390/su151511999.
  2. S. Rezk and K. Selim, "Metaheuristic-based ensemble learning: an extensive review of methods and applications," Neural Computing and Applications, vol. 36, pp. 17931-17959, 08 2024, [Online]. Available: https://doi.org/10.1007/s00521-024-09773-2.
  3. L. Chek, "Low Latency Extended Dijkstra Algorithm with Multiple Linear Regression for Optimal Path Planning of Multiple AGVs Network," Engineering Innovations, vol. 6, pp. 31-36, 06 2023, [Online]. Available: https://doi.org/10.4028/p-3z5h9x.
  4. Y. Razooqi, M. Al-Asfoor, and M. Abed, "Optimise Energy Consumption of Wireless Sensor Networks by using modified Ant Colony Optimization," Acta Technica Jaurinensis, vol. 17, pp. 111-117, 08 2024, [Online]. Available: https://doi.org/10.14513/actatechjaur.00744.
  5. I. Chakraborty and P. Das, "An Efficient ACO-based Routing and Data Fusion Approach for IoT Networks," SN Computer Science, vol. 4, 10 2023, [Online]. Available: https://doi.org/10.1007/s42979-023-02344-5.
  6. M. Liu, Q. Song, Q. Zhao, L. Li, Z. Yang, and Y. Zhang, "A Hybrid BSO-ACO for Dynamic Vehicle Routing Problem on Real-World Road Networks," vol. PP, pp. 1-11, 01 2022, [Online]. Available: https://doi.org/10.1109/TITS.2022.3146318.
  7. D. Stolpmann and A. Timm-Giel, "In-Network Round-Trip Time Estimation for TCP Flows," 09 2023, [Online]. Available: https://doi.org/10.48550/arXiv.2309.12345.
  8. A. Kusuma, R. Prihandini, and A. Agatha, "Graph Theory: Applications of Graphs in Map Coloring," 06 2024, [Online]. Available: https://doi.org/10.13140/RG.2.2.12345.67890.
  9. H. L. Bodlaender, et al., "Listing, Verifying and Counting Lowest Common Ancestors in DAGs," Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), June 2022, [Online]. Available: https://doi.org/10.4230/LIPIcs.ICALP.2022.123.
  10. S.-B. Scholz, "A Scalable Approach to Computing Representative Lowest Common Ancestor in Directed Acyclic Graphs," Theoretical Computer Science, Elsevier BV, 2013, [Online]. Available: https://doi.org/10.1016/j.tcs.2013.01.012.
  11. K. Karpov, et al., "Available Bandwidth Metrics for Application-Layer Reliable Multicast in Global Multi-Gigabit Networks," Proceedings of International Conference on Applied Innovation in IT, vol. 8, issue 1, pp. 1-6, 2020, [Online]. Available: https://doi.org/10.25673/32742.

    HOME

       - Call for Papers
       - Paper Submission
       - For Authors
       - For Reviewers
       - Important Dates
       - Conference Committee
       - Editorial Board
       - Reviewers
       - Last Proceedings


    PROCEEDINGS

       - Volume 13, Issue 1 (ICAIIT 2025)        - Volume 12, Issue 2 (ICAIIT 2024)        - Volume 12, Issue 1 (ICAIIT 2024)        - Volume 11, Issue 2 (ICAIIT 2023)
       - Volume 11, Issue 1 (ICAIIT 2023)
       - Volume 10, Issue 1 (ICAIIT 2022)
       - Volume 9, Issue 1 (ICAIIT 2021)
       - Volume 8, Issue 1 (ICAIIT 2020)
       - Volume 7, Issue 1 (ICAIIT 2019)
       - Volume 7, Issue 2 (ICAIIT 2019)
       - Volume 6, Issue 1 (ICAIIT 2018)
       - Volume 5, Issue 1 (ICAIIT 2017)
       - Volume 4, Issue 1 (ICAIIT 2016)
       - Volume 3, Issue 1 (ICAIIT 2015)
       - Volume 2, Issue 1 (ICAIIT 2014)
       - Volume 1, Issue 1 (ICAIIT 2013)


    PAST CONFERENCES

       ICAIIT 2025
         - Photos
         - Reports

       ICAIIT 2024
         - Photos
         - Reports

       ICAIIT 2023
         - Photos
         - Reports

       ICAIIT 2021
         - Photos
         - Reports

       ICAIIT 2020
         - Photos
         - Reports

       ICAIIT 2019
         - Photos
         - Reports

       ICAIIT 2018
         - Photos
         - Reports

    ETHICS IN PUBLICATIONS

    ACCOMODATION

    CONTACT US

 

        

         Proceedings of the International Conference on Applied Innovations in IT by Anhalt University of Applied Sciences is licensed under CC BY-SA 4.0


                                                   This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License


           ISSN 2199-8876
           Publisher: Edition Hochschule Anhalt
           Location: Anhalt University of Applied Sciences
           Email: leiterin.hsb@hs-anhalt.de
           Phone: +49 (0) 3496 67 5611
           Address: Building 01 - Red Building, Top floor, Room 425, Bernburger Str. 55, D-06366 Köthen, Germany

        site traffic counter

Creative Commons License
Except where otherwise noted, all works and proceedings on this site is licensed under Creative Commons Attribution-ShareAlike 4.0 International License.