Multi-graph network population evolutionary optimization algorithm with migration and best hunter crossover strategies for cross-field applications
Zhaoyang Lian , Bailu Si
An International Journal of Optimization and Control: Theories & Applications ›› 2026, Vol. 16 ›› Issue (1) : 17 -39.
Although swarm intelligence optimization algorithms, such as simulating biological bionic behaviors or natural laws have been relatively mature, there are relatively few algorithms considering multi-graph network evolutionary behaviors and the algorithms combining graph network structure with biomimetic behaviors are worth studying. In this paper, a multi-graph network population optimization algorithm with migration and best hunter crossover strategies was proposed for cross-field applications. The gorgeous central radial multi-graph matrices were rotated and deformed to change different formations while hunting prey. The global graph population of a strong group was adopted to explore prey in a large range and the local graph population of a weak group was adopted to guard food in a small range near their prey or home. The migration strategy was aimed at reducing overexploitation by hunters and the best hunter crossover strategy was aimed to retain the excellent genes of the best hunter while also preserving the vitality of new individuals. Furthermore, the proposed algorithm was applied to open-source function optimization problems, and extended to four engineering applications and design problems such as multi-sector aviation scheduling, flexible workshop scheduling optimization, unmanned aerial vehicle routing optimization of oil plants in three-dimensional maps, and power system bus type optimization achieving competitive results.
Swarm intelligence algorithm / Multi-graph network / Evolutionary optimization algorithm / Cross field applications / Heuristic algorithm
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
/
| 〈 |
|
〉 |