Abstract
In recent years, bioinspired algorithms based on the use of a population approach and a probabilistic search strategy have become especially popular among researchers involved in multidimensional and multicriteria optimization. Such algorithms are based on the principles of cooperative behavior of a decentralized self-organizing colony of living organisms (bees, ants, birds, etc.) to achieve certain goals (for example, to meet nutritional needs). However, their practical application encounters a number of difficulties leading to a decrease in convergence. This article discusses the possibility of modifying the artificial bee colony algorithm by using a hybridization strategy with various data mining methods. One of these difficulties is the lack of a reasonable approach to determining initial search positions. As a solution, it is proposed to divide the population into clusters, the centers of which will be the initial positions. The need for interaction between individuals makes it advisable to use fuzzy clustering, which allows the formation of intersecting clusters. Another difficulty is associated with the choice of “free” parameters, for which the authors have not developed recommendations for choosing their optimal values. To solve this problem, it is proposed to use the idea of coevolution, which consists in the parallel launch of several interacting subpopulations, for each of which different “settings” are applied. The proposed algorithm is applicable to multidimensional optimization tasks, in which it is necessary to find such a combination of different types of elements belonging to some “large” population that will ensure the achievement of the maximum effect under given restrictions. Examples of such tasks are determining the species and quantitative composition of plants to form the terrestrial ecosystem of a carbon farm or mass recruiting, which consists of selecting a large number of personnel for the same positions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.