Discussing the article: "Competitive Learning Algorithm (CLA)"

[MetaQuotes]

Check out the new article: Competitive Learning Algorithm (CLA).

The article presents the Competitive Learning Algorithm (CLA), a new metaheuristic optimization method based on simulating the educational process. The algorithm organizes the population of solutions into classes with students and teachers, where agents learn through three mechanisms: following the best in the class, using personal experience, and sharing knowledge between classes.

Over the past decades, many bioinspired algorithms have been proposed, from ant colonies and particle swarms to gray wolves and whales. However, human society, with its complex social interactions, can also serve as a rich source of ideas for effective optimization methods. This idea is the basis for the Competitive Learning Algorithm (CLA).

CLA uses a metaphor of the educational process, where the population of solutions is represented by students organized into classes. The algorithm elegantly models three types of learning: from the best in the class (teacher), from personal experience, and through cross-class interaction. This approach provides a balance between exploring the search space and exploiting the good solutions found, which is critical for effective optimization.

In this article, we will examine in detail the principles of CLA, its mathematical basis, implementation features, and compare its effectiveness with other popular metaheuristics on our standard test functions.

Author: Andrey Dik