Key points are not available for this paper at this time.
As a meta-heuristic algorithm, the ant colony algorithm has been successfully used to solve various combinatorial optimization problems. However, the existing algorithm that takes the power of ants to solve distributed constraint optimization problems (ACODCOP) is easy to fall into local optima. To deal with this issue, this paper presents an adaptive ant colony algorithm based on local information entropy to solve distributed constraint optimization problems, named LIEAD. In LIEAD, the local information entropy is introduced to help agents adaptively select the pheromone update strategy and value selection strategy, which improves the convergence speed and the quality of the solution. Moreover, a restart mechanism is designed to break the accumulation state of pheromone, which increases the population diversity and helps the algorithm jump out of the local optima. The extensive experimental results indicate that LIEAD can significantly outperform ACODCOP and is competitive with the state-of-the-art DCOPs algorithms.
Shi et al. (Fri,) studied this question.