Preprint
Article

An Improved EigenAnt Algorithm That Achieves a Balance between Intensification and Diversification

This version is not peer-reviewed.

Submitted:

07 December 2018

Posted:

11 December 2018

Read the latest preprint version here

Abstract
The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.
Keywords: 
EigenAnt; parameter impact analysis; intensification and diversification balance; routing networks
Subject: 
Computer Science and Mathematics  -   Data Structures, Algorithms and Complexity
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Altmetrics

Downloads

401

Views

600

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated