Controlling the Balance of Exploration and Exploitation in ACO Algorithm

Abstract

Ant colony optimization is a meta-heuristic algorithm inspired by the foraging behavior of real ant colony. The algorithm is a population-based solution employed in different optimization problems such as classification, image processing, clustering, and so on. This paper sheds the light on the side of improving the results of traveling salesman problem produced by the algorithm. The key success that produces the valuable results is due to the two important components of exploration and exploitation. Balancing both components is the foundation of controlling search within the ACO. This paper proposes to modify the main probabilistic method to overcome the drawbacks of the exploration problem and produces global optimal results in high dimensional space. Experiments on six variant of ant colony optimization indicate that the proposed work produces high-quality results in terms of shortest route

Adaptive Parameter Control Strategy for Ant-Miner Classification Algorithm

“…ACO is a swarm-intelligence metaheuristic algorithm used to solve combinatorial optimization problems. This algorithm was first applied to the traveling salesman problem and has since been widely applied to a variety of NP-hard optimization problems, such as quadratic assignment problems, vehicle routing with time windows, grid computing, and data mining [21], [22]. The first ACO algorithm is the ant system, proposed by Dorigo et al in the 1990s [23].…”

Ant-based sorting and ACO-based clustering approaches: A review

“…Exploration and exploitation are the key algorithmic components of the metaheuristic algorithm [19,20]. Exploration is a global search space that produces diverse solutions while exploitation generates information based on the regions exploited in the search on the local region [21]. However, any optimization approach can successfully solve any problem when the balance between the two components is optimal [22,23].…”

An improved ACS algorithm for data clustering

“…Although the metaheuristic approach does not guarantee an optimal clustering solution, it can find good solutions within a 1507 relatively short time in practice. This approach performs clustering on the basis of an individual or a population [18][19][20]. Ant colony optimisation (ACO) is a metaheuristic algorithm based on the foraging behaviour of ants.…”