Comparative Analysis of Four Prominent Ant Colony Optimization Variants: Ant System, Rank-Based Ant System, Max-Min Ant System, and Ant Colony System
Abstract: This research conducts a comparative analysis of four Ant Colony Optimization (ACO) variants -- Ant System (AS), Rank-Based Ant System (ASRank), Max-Min Ant System (MMAS), and Ant Colony System (ACS) -- for solving the Traveling Salesman Problem (TSP). Our findings demonstrate that algorithm performance is significantly influenced by problem scale and instance type. ACS excels in smaller TSP instances due to its rapid convergence, while PACS proves more adaptable for medium-sized problems. MMAS consistently achieves competitive results across all scales, particularly for larger instances, due to its ability to avoid local optima. ASRank, however, struggles to match the performance of the other algorithms. This research provides insights into the strengths and weaknesses of these ACO variants, guiding the selection of the most suitable algorithm for specific TSP applications.
- Skinderowicz, R. (2020). Improving Ant Colony Optimization Efficiency for Solving Large TSP. arXiv preprint arXiv:2203.02228. https://arxiv.org/abs/2203.02228
- Skinderowicz, R. (2022). Authoritative Reference for ArXiv Paper. DOI.org. Note: arXiv:2203.02228v1 [cs.NE]. https://doi.org/10.48550/arXiv.2203.02228
- Skinderowicz, R. (2022). An Extended Work by Skinderowicz. DOI.org. https://doi.org/10.1016/j.asoc.2022.108653
- Rafal Skinderowicz. (2022). Improving Ant Colony Optimization Efficiency for Solving Large TSP. arXiv:2203.02228. https://arxiv.org/abs/2203.02228
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.