An improved multiobjective evolutionary algorithm based on decomposition approach and its application in antenna array beam pattern synthesis

• Published in: International journal of numerical modelling Vol. 35; no. 1
• Main Authors: Liang, Shuang, Fang, Zhiyi, Li, Guanxiao, Zhao, Yaqing, Liu, Xuejie, Sun, Geng
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Inc 01.01.2022; Wiley Subscription Services, Inc
• Subjects: antenna array; Antenna arrays; Antennas; beam pattern; Convergence; Decomposition; Euclidean geometry; Evolutionary algorithms; evolutionary computation; Genetic algorithms; MOEA/D; Mopping; multiobjective optimization problem; Multiple objective analysis; Normal distribution; Optimization; Sidelobes; Synthesis; Wireless communication systems
• ISSN: 0894-3370; 1099-1204
• DOI: 10.1002/jnm.2935

Antenna arrays can enhance the performance and reduce the overhead of the wireless communication systems. However, the beam pattern synthesis of antenna arrays are difficult problems since the optimization properties are usually trade‐offs that affect each other. In this paper, we formulate a multiobjective beam pattern optimization problem (MBPOP) to simultaneously reduce the maximum sidelobe level (SLL) and achieve the nulls of the antenna array beam pattern. The multiobjective evolutionary algorithm based on decomposition (MOEA/D) is a general and effective algorithm to solve the MOPs. However, it may be easy to lose population diversity and converge to local optimum. To overcome the issues above, we propose an improved MOEA/D (IMOEA/D) to deal with the formulated MBPOP. IMOEA/D introduces the normal distribution crossover operator (NDX), Lévy flight strategy and Euclidean distance‐based solution selection mechanism to enhance the performance of conventional MOEA/D to make it more suitable to solve the formulated MBPOP. Experiments are conducted and the results indicate that the proposed IMOEA/D has a better performance in terms of the convergence rate and population diversity compared to other algorithms for solving the formulated MBPOP.