Biblio
Filters: Keyword is Grey Wolf optimizer [Clear All Filters]
An Adaptive Grey Wolf Algorithm Based on Population System and Bacterial Foraging Algorithm. 2020 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA). :744–748.
.
2020. In this thesis, an modified algorithm for grey wolf optimization in swarm intelligence optimization algorithm is proposed, which is called an adaptive grey wolf algorithm (AdGWO) based on population system and bacterial foraging optimization algorithm (BFO). In view of the disadvantages of premature convergence and local optimization in solving complex optimization problems, the AdGWO algorithm uses a three-stage nonlinear change function to simulate the decreasing change of the convergence factor, and at the same time integrates the half elimination mechanism of the BFO. These improvements are more in line with the actual situation of natural wolves. The algorithm is based on 23 famous test functions and compared with GWO. Experimental results demonstrate that this algorithm is able to avoid sinking into the local optimum, has good accuracy and stability, is a more competitive algorithm.
Joint User Association and Power Allocation Using Swarm Intelligence Algorithms in Non-Orthogonal Multiple Access Networks. 2020 9th International Conference on Modern Circuits and Systems Technologies (MOCAST). :1–4.
.
2020. In this paper, we address the problem of joint user association and power allocation for non-orthogonal multiple access (NOMA) networks with multiple base stations (BSs). A user grouping procedure into orthogonal clusters, as well as an allocation of different physical resource blocks (PRBs) is considered. The problem of interest is mathematically described using the maximization of the weighted sum rate. We apply two different swarm intelligence algorithms, namely, the recently introduced Grey Wolf Optimizer (GWO), and the popular Particle Swarm Optimization (PSO), in order to solve this problem. Numerical results demonstrate that the above-described problem can be satisfactorily addressed by both algorithms.