Welcome to the InfoSci Platform
Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem

Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem

Gloria Lola Quispe, Maria Fernanda Rodríguez, José Daniel Ontiveros
Copyright: © 2021 |Pages: 21
ISBN13: 9781799870104|ISBN10: 1799870103|ISBN13 Softcover: 9781799870111|EISBN13: 9781799870128
DOI: 10.4018/978-1-7998-7010-4.ch014
Cite Chapter Cite Chapter

MLA

Quispe, Gloria Lola, et al. "Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem." Handbook of Research on Software Quality Innovation in Interactive Systems, edited by Francisco Vicente Cipolla-Ficarra, IGI Global, 2021, pp. 338-358. https://doi.org/10.4018/978-1-7998-7010-4.ch014

APA

Quispe, G. L., Rodríguez, M. F., & Ontiveros, J. D. (2021). Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem. In F. Cipolla-Ficarra (Ed.), Handbook of Research on Software Quality Innovation in Interactive Systems (pp. 338-358). IGI Global. https://doi.org/10.4018/978-1-7998-7010-4.ch014

Chicago

Quispe, Gloria Lola, Maria Fernanda Rodríguez, and José Daniel Ontiveros. "Comparative Analysis of ACO Algorithms for the Solution of the Travelling Salesman Problem." In Handbook of Research on Software Quality Innovation in Interactive Systems, edited by Francisco Vicente Cipolla-Ficarra, 338-358. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-7998-7010-4.ch014

Export Reference

Mendeley
Favorite

Abstract

Metaheuristics are non-deterministic algorithms. Metaheuristic strategies are related to design. This chapter presents an introduction on metaheuristics, from the point of view of its theoretical study and the foundations for its use. Likewise, a description and comparative study of the ant colony-based algorithms is carried out. These are ant system (AS), ant colony system (ACS), and max-min ant system (MMAS). These results serve to deliver solutions to complex problems and generally with a high degree of combinatorics for those there is no way to find the best reasonable time. An experimentation and analysis of the results of the ACO algorithms (optimization by ants colonies) is also carried out. For the evaluation of the algorithms, comparisons are made for instances of the TSPLIB test instance library. Therefore, it is deepened in the resolution of the travelling salesman problem (TSP), and a comparative analysis of the different algorithms is carried out in order to see which one adjusts better.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.