607caf31-4ddb-4271-a981-109d07ebf8e820250717124915030wseas:wseasmdt@crossref.orgMDT DepositInternational Journal of Applied Mathematics, Computational Science and Systems Engineering2766-982310.37394/232026https://wseas.com/journals/amcse/31220253122025710.37394/232026.2025.7https://wseas.com/journals/amcse/2025.phpOlasunmbo O.AgboolaDepartment of Mathematics, Covenant University, NIGERIADeborah T.ObembeDepartment of Mathematics, Covenant University, NIGERIAMichael C.AgaranaDepartment of Quality and Operations Management, University of Johannesburg, SOUTH AFRICAAnt Colony Optimisation (ACO) is a meta-heuristic method that has drawn much interest in solving challenging optimisation issues. This paper examines the use of ACO to reduce the time spent on moving goods and people in Covenant University's transportation system. Covenant University is a private Christian university in Ota, Ogun State, Nigeria. Covenant University started on 21st October 2002, and since its opening, it has grown to be one of the world-class universities that have been ranked and recognised all around the globe. The data was collected from an article that computed the time per unit distance between origins and destinations within the university using Google Maps. The three traditional transportation techniques (Northwest corner method, least cost method, and Vogel's approximation method) alongside Ant colony meta-heuristics were used to get the initial basic feasible solution, which gave (361.3, 361.7, 359.8, 361.7) minutes, respectively. Then, the MODI approach was used to find the optimal solution (346.6 minutes). Also, the R programming language was used to run the Codes for the three traditional methods and the ACO method, which gave the result of solving manually. The optimal solution showed that if the time spent is reduced, the movement of people and goods would be enhanced, resulting in more time to handle important matters.7172025717202515416412https://wseas.com/journals/amcse/2025/a24amcse-010(2025).pdf10.37394/232026.2025.7.12https://wseas.com/journals/amcse/2025/a24amcse-010(2025).pdf10.1007/b99492M. Dorigo and T. Stützle, “Ant Colony Optimization and Swarm Intelligence,” in 4th International Workshop, M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, Eds., in Lecture Notes in Computer Science, vol. 3172. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 5–8. https://doi.org/10.1007/B99492 10.1007/978-981-99-0601-7_18O. F. Ademola, S. Misra, and A. Agrawal, “Improving Real-Time Intelligent Transportation Systems in Predicting Road Accident,” Lecture Notes in Electrical Engineering, vol. 1011 LNEE, 2023, pp. 225– 239. https://doi.org/10.1007/978-981-99-0601- 7_18 A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed Optimisation by Ant Colonies,” 2019. Orkin, “Can Ants Smell? | Ant Behaviors & Habits | Orkin,” Orkin LLC. Accessed: Mar. 19, 2024. [Online]. Available: https://www.orkin.com/pests/ants/can-antssmell 10.1101/2022.12.04.518909L. E. Lopes, E. T. Frank, Z. Kárpáti, T. Schmitt, and D. J. C. Kronauer, “The Alarm Pheromone and Alarm Response of the Clonal Raider Ant,” J Chem Ecol, vol. 49, no. 1–2, Feb. 2023, pp. 1– 10. https://doi.org/10.1007/s10886-023-01407- 4. 10.29121/granthaalayah.v6.i5.2018.1457K. R. Ravi, G. Radha, and O. Karthiyayini, “A NEW APPROACH TO FIND THE INITIAL BASIC FEASIBLE SOLUTION OF A TRANSPORTATION PROBLEM,” International Journal of Research - GRANTHAALAYAH, vol. 6, May 2018, Accessed: May 31, 2024. https://doi.org/10.29121/granthaalayah.v6.i5.20 18.1457 10.4236/ojapps.2023.132017R. Shubham, “New Approach to Find Initial Basic Feasible Solution (IBFS) for Optimal Solution in Transportation Problem,” Open Journal of Applied Sciences , vol. 13, Feb. 2023, pp. 207–211. Accessed: May 31, 2024. https://doi.org/10.4236/ojapps.2023.132017 10.1016/j.cie.2020.106610I. Dzalbs and T. Kalganova, “Accelerating supply chains with Ant Colony Optimization across a range of hardware solutions,” Comput Ind Eng, vol. 147, Sep. 2020, pp. 1–14. https://doi.org/10.1016/j.cie.2020.106610. M. C. Agarana, A. E. Owoloko, and K. Adeshakin, “Enhancing the movement of people and goods in a potential world class University Using Transportation model,” Global Journal of Pure and Applied Mathematics, vol. 12, no. 0973–1768, 2016, pp. 281–294. Accessed: Aug. 19, 2016. https://www.researchgate.net/publication/30376 3088 Findley R., “Ant Colony Optimization for Continuous Spaces,” 2016. https://scholarworks.uark.edu/csceuht/35 10.3390/engproc2023045037L. Xu, J. Guo, and L. Zhu, “Ant Colony Optimisation Algorithm for the Hybrid Flow Shop Scheduling Problem with Integrated Consideration of Fixture Re-sources †,” Engineering Proceedings, Vol.45, 2023, pp. 37. https://doi.org/10.3390/engproc2 023045037 10.1007/978-981-16-1480-4_7K. E. Nwankwo, S. I. Abdulhamid, J. A. Ojeniyi, S. Misra, J. Oluranti, and R. Ahuja, “A Panacea to soft computing approach for Sinkhole attack classification in a wireless sensor networks environment,” In Futuristic Trends in Network and Communication Technologies: Third International Conference, FTNCT 2020, Taganrog, Russia, October 14–16, 2020, Revised Selected Papers, Part I 3 2021, pp. 78-87. Springer Singapore. https://doi.org/10.1007/978- 981-16-1480-4_7 10.1109/tevc.2002.802444T. St˜utzle, and M. Dorigo, “A Short Convergence Proof for a Class of Ant Colony Optimisation Algorithms,” IEEE Transactions on Evolutionary Computation, Vol.6, 2002, pp. 358–365. https://doi.org/10.1109/TEVC.2002.802444