Skip to content
Research Article Open access CC BY 4.0

Ant Colony Optimization (ACO) for Traveling Salesman Problem: A Review

Warveen merza eido, Ibrahim Mahmood Ibrahim

Asian Journal of Research in Computer Science · pp. 20–45 · Published 28 Jan 2025

10.9734/ajrcos/2025/v18i2559

Abstract

The traveling salesman problem (TSP) is a fundamental combinatorial optimization problem with applications in resource management, logistics, and communications. In order to address TSP and its differences, this paper discusses developments in Ant Colony Optimization (ACO), a biologically inspired algorithm. Inspired by the foraging activity of ants, ACO's decentralized and recursive methodology has proven successful in solving difficult routing problems. ACO's scalability, convergence speed, and solution quality have been greatly enhanced over time through innovations including hybridization with algorithms such as Firefly, genetic algorithms, parallel computing frameworks, and adaptation mechanisms. These developments have given the ACO the flexibility and efficiency to handle dynamic situations, such as real-time vehicle guidance and underwater navigation. Despite its progress, issues remain such as scalability in resource-limited contexts, processing overhead, and reliance on parameter modification. This work summarizes current developments in ACO, noting how revolutionary the TSP solution is, pointing out its drawbacks, and suggesting areas for further study. Leveraging emerging technologies like machine learning and quantum computing, ACO has huge potential to progressively address challenging real-world problems. This review provides a comprehensive framework for developing uses of ACOs and reaffirms their status as a key component of improvement research.

Traveling Salesman Problem (TSP) Ant Colony Optimization (ACO) metaheuristic algorithms dynamic routing hybrid optimization techniques parallel computing in optimization real-world applications of ACO

Cited by 14

A reinforcement learning-enhanced discrete zebra optimization algorithm for solving the traveling salesman problem

S. Ghatei, Shiva TaghipourEivazi, Ahmad Habibi Zadnavin · Scientific Reports · 2026

Metaheuristic optimization of deep CNNs for multi-class diagnosis of cervical cancer and lymphoma

E. Abdelhay, K. M. Elgamily, W. Badr · Scientific Reports · 2026

Ant colony optimization approach for sustainable end-milling with minimum quantity nano-green lubrication

Mustafa Abdullah, A. U. Umamaheshwer Rao, T. Ramachandran · Scientific Reports · 2026

Continuous Ant Colony Optimization Algorithm Based on Gradient and Adaptive Step Size

Chuanlong Liu, Yi-Zhi Zhang · 2025 5th International Symposium on Artificial Intelligence and Big Data (AIBDF) · 2025

A Comparative Review and Analysis of Heuristic and Metaheuristic Optimization Techniques

Baidaa Mutasher Rashed · Automation, Control, and Information Technology · 2025

Enhancing ACO Stability and Performance for Urban VRP via Clustering and Intersection Penalty

Jin Xu, Jinxing Zhao · International Conference Control Science and Systems Engineering · 2025

NMS-EACO: A Novel Multi-Strategy ACO for Mobile Robot Path Planning

Chao Zhang, Jingzhuo Ma, Xin Wang · Electronics · 2025

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

14

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.