This paper investigates an update strategy for the Univariate Marginal Distribution Algorithm (UMDA) probabilistic model inspired by the equations of the Ant Colony Optimization (ACO) computational paradigm. By adapting ACO's transition probability equations to the univariate probabilistic model, it is possible to control the balance between exploration and exploitation by tuning a single parameter. It is expected that a proper balance can improve the scalability of the algorithm on hard problems with bounded difficulties and experiments conducted on such problems with increasing difficulty and size confirmed these assumptions. These are important results because the performance is improved without increasing the complexity of the model, which is known to have a considerable computational effort. © 2011 Springer-Verlag.
CITATION STYLE
Fernandes, C. M., Lima, C. F., Laredo, J. L. J., Rosa, A. C., & Merelo, J. J. (2011). An ant-based rule for UMDA’s update strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5778 LNAI, pp. 391–398). https://doi.org/10.1007/978-3-642-21314-4_49
Mendeley helps you to discover research relevant for your work.