Abstract
Ant colony optimization (ACO) is a metaheuristic for solving combinatorial optimization problems that is based on the foraging behavior of biological ant colonies. Starting with the 1996 seminal paper by Dorigo, Maniezzo and Colorni, ACO techniques have been used to solve the traveling salesperson problem (TSP). In this paper, we focus on a particular type of the ACO algorithm, namely, the rank-based ACO algorithm for the TSP. In particular, this paper identifies an optimal set of key parameters by statistical analysis applied to results of the rank-based ACO for the TSP. Specifically, for six frequently used TSPs available on the World Wide Web, we will solve a total of 27 000 instances for each problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
