The paper proposes a hybrid multi-agent solution search algorithm containing procedures that simulate the behavior of a bee colony, a swarm of agents and co-evolution methods, with a reconfigurable architecture. The developed hybrid algorithm is based on a hierarchical multi-population approach, which allows, using the diversity of a set of solutions, to expand the areas of search for solutions. Formulations of metaheuristics for a bee colony and a swarm of agents of a canonical species are presented. As a measure of the similarity of two solutions, affinity is used - a measure of equivalence, relatedness (similarity, closeness) of two solutions. The principle of operation and application of the directed mutation operator is revealed. A description of the modified chromosome swarm paradigm is given, which provides the ability to search for solutions with integer parameter values, in contrast to canonical methods. The time complexity of the algorithm is O(n2)-O(n3).

Keywords: swarm of agents, bee colony, co-evolution, search space, hybridization, reconfigurable architecture