Abstract

In this paper we present a heterogeneous multi-colony ant optimization with a novel interaction strategy named pheromone fusion to balance the search ability and the convergence speed of the conventional ant colony optimization. The pheromone fusion performs interaction directly and effectively by the interchange of the pheromone matrices. It could exploit the benefits of pheromone distribution and take full use of the advantages of heterogeneous sub-colonies. There are also two states defined in this study to control the interaction. The global state based on KL divergence determines which sub-colonies should interact with each other, while the local state based on information entropy decides when a sub-colony starts interaction. These two states greatly improve the adaptability and ensure the effectiveness of the interaction. In addition, a reward and punishment strategy is introduced to adjust the pheromone distribution and facilitate the interaction. The experimental results on the Traveling Salesman Problem demonstrate that the proposed algorithm outperforms the multi-colony algorithms presented in some recent works. The studies also indicate that the proposed algorithm could improve the solution quality and accelerate the convergence compared with single-colony algorithms.

Highlights

  • Ant Colony Optimization (ACO) [1] is one of the most effective evolutionary algorithms, which simulates the foraging behavior of ants in nature

  • As we found that the pheromone distribution could identify the search behavior of a certain colony, such as the best path found presently and the current situation of convergence, the interchange between pheromone matrices would be a direct and effective method to impact the search behavior and take full advantages of each sub-colony

  • ALGORITHM In this subsection, the proposed algorithm is summarized in Algorithm 1, where the input hpk is the collection of parameters for the colony k, the output pathbest is the searched best path, Phk is the pheromone matrix, T is the maximum of iteration number, K is the colony number and pathkbest is the best path of one certain colony

Read more

Summary

INTRODUCTION

Ant Colony Optimization (ACO) [1] is one of the most effective evolutionary algorithms, which simulates the foraging behavior of ants in nature. The improvements of ACO above have greatly boosted the performance These algorithms are based on a single colony with pheromone self-update mechanism. It is able to efficiently diversify the whole system The interaction of these heterogeneous sub-colonies could take full use of their abilities so as to improve the exploration while keeping fast convergence. A. MOTIVATIONS AND CONTRIBUTIONS The interaction strategy of multi-colony algorithms mainly focuses on the global and the local pheromone update formulas and new kinds of sub-colonies. We proposed a multi-colony ant optimization with a novel interaction strategy named pheromone fusion to expand the search area while improving the convergence ability. 2) The global state and the local state are defined in this paper to control the interaction to improve the adaptability and ensure the effectiveness It could further exploit the benefits of pheromone distribution.

ANT COLONY SYSTEM
GLOBAL STATE
LOCAL STATE
PHERONOMONE FUSION
REWARD AND PUNISHMENT STRATEGY
EXPERIMENTAL RESULTS
COMPARISON WITH SINGLE-COLONY SYSTEMS
CONCLUSION
Full Text
Published version (Free)

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 call