Pareto Optimal Design of Dual-Band Base Station Antenna Arrays Using Multi-Objective Particle Swarm Optimization With Fitness Sharing

2009 ◽  
Vol 45 (3) ◽  
pp. 1522-1525 ◽  
Author(s):  
Sotirios K. Goudos ◽  
Zaharias D. Zaharis ◽  
Dimitra G. Kampitaki ◽  
Ioannis T. Rekanos ◽  
Costas S. Hilas
Keyword(s):  
Particle Swarm Optimization ◽  
Optimal Design ◽  
Antenna Arrays ◽  
Particle Swarm ◽  
Base Station ◽  
Dual Band ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Fitness Sharing

Particle Swarm Optimization Algorithms Applied to Antenna and Microwave Design Problems

2012 ◽  
pp. 100-126
Author(s):  
Sotirios K. Goudos ◽  
Zaharias D. Zaharis ◽  
Konstantinos B. Baltzis
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Dual Band ◽  
Design Problems ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Fitness Sharing ◽  
Microwave Design ◽  
Velocity Mutation

Particle Swarm Optimization (PSO) is an evolutionary optimization algorithm inspired by the social behavior of birds flocking and fish schooling. Numerous PSO variants have been proposed in the literature for addressing different problem types. In this chapter, the authors apply different PSO variants to common antenna and microwave design problems. The Inertia Weight PSO (IWPSO), the Constriction Factor PSO (CFPSO), and the Comprehensive Learning Particle Swarm Optimization (CLPSO) algorithms are applied to real-valued optimization problems. Correspondingly, discrete PSO optimizers such as the binary PSO (binPSO) and the Boolean PSO with velocity mutation (BPSO-vm) are used to solve discrete-valued optimization problems. In case of a multi-objective optimization problem, the authors apply two multi-objective PSO variants. Namely, these are the Multi-Objective PSO (MOPSO) and the Multi-Objective PSO with Fitness Sharing (MOPSO-fs) algorithms. The design examples presented here include microwave absorber design, linear array synthesis, patch antenna design, and dual-band base station antenna optimization. The conclusion and a discussion on future trends complete the chapter.

Particle Swarm Optimization as Applied to Electromagnetic Design Problems

2018 ◽  
Vol 9 (2) ◽  
pp. 47-82 ◽  
Author(s):  
Sotirios K. Goudos ◽  
Zaharias D. Zaharis ◽  
Konstantinos B. Baltzis
Keyword(s):  
Particle Swarm Optimization ◽  
Mobile Communications ◽  
Transfer Functions ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Base Station ◽  
Dual Band ◽  
Design Problems ◽  
Swarm Optimization ◽  
Multi Objective

Particle swarm optimization (PSO) is a swarm intelligence algorithm inspired by the social behavior of birds flocking and fish schooling. Numerous PSO variants have been proposed in the literature for addressing different problem types. In this article, the authors apply different PSO variants to common design problems in electromagnetics. They apply the Inertia Weight PSO (IWPSO), the Constriction Factor PSO (CFPSO), and the Comprehensive Learning Particle Swarm Optimization (CLPSO) algorithms to real-valued optimization problems, i.e. microwave absorber design, and linear array synthesis. Moreover, the authors use discrete PSO optimizers such as the binary PSO (binPSO) and the Boolean PSO with a velocity mutation (BPSO-vm) in order to solve discrete-valued optimization problems, i.e. patch antenna design. Additionally, the authors apply and compare binPSO with different transfer functions to thinning array design problems. In the case of a multi-objective optimization problem, they apply two multi-objective PSO variants to dual-band base station antenna optimization for mobile communications. Namely, these are the Multi-Objective PSO (MOPSO) and the Multi-Objective PSO with Fitness Sharing (MOPSO-fs) algorithms. Finally, the authors conclude the paper by providing a discussion on future trends and the conclusion.

scholarly journals A novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm

2020 ◽  
Author(s):  
Ahlem Aboud ◽  
Raja Fdhila ◽  
Amir Hussain ◽  
Adel Alimi
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Search Space ◽  
Response Strategy ◽  
Pareto Optimal ◽  
Distributed Architecture ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set

Distributed architecture-based Particle Swarm Optimization is very useful for static optimization and not yet explored to solve complex dynamic multi-objective optimization problems. This study proposes a novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm with two optimization levels. In the first level, all solutions are optimized in the same search space and the second level is based on a distributed architecture using the Pareto ranking operator for dynamic multi-swarm subdivision. The proposed approach adopts a dynamic handling strategy using a set of detectors to keep track of change in the objective function that is impacted by the problem’s time-varying parameters at each level. To ensure timely adaptation during the optimization process, a dynamic response strategy is considered for the reevaluation of all non-improved solutions, while the worst particles are replaced with a newly generated one. The convergence and<br>diversity performance of the DPb-MOPSO algorithm are proven through Friedman Analysis of Variance, and the Lyapunov theorem is used to prove stability analysis over the Inverted Generational Distance (IGD) and Hypervolume Difference (HVD) metrics. Compared to other evolutionary algorithms, the novel DPb-MOPSO is shown to be most robust for solving complex problems over a range of changes in both the Pareto Optimal Set and Pareto Optimal Front. <br>

Multi-Objective Particle Swarm Optimization with Comparison Scheme and New Pareto-Optimal Search Strategy

2014 ◽  
Vol 496-500 ◽  
pp. 1895-1900
Author(s):  
Wen Wang ◽  
Wei Shen ◽  
Chao Long Ying ◽  
Xin Yi Yang
Keyword(s):  
Particle Swarm Optimization ◽  
Search Strategy ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Experimental Results ◽  
Pareto Optimal ◽  
Optimal Search ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Convergence Performance

In the presented article, a novel multi-objective PSO algorithm, RP-MOPSO has been proposed. The algorithm adopts a new comparison scheme for position upgrading. The scheme is simple but effective in improve algorithms convergence speed. A sigma-density strategy of selecting the global best particle for each particle in swarm based on a new solutions density definition is designed. Experimental results on seven functions show that proposed algorithm show better convergence performance than other classical MOP algorithms. Meanwhile the proposed algorithm is more effective in maintaining the diversity of the solutions.

scholarly journals DPb-MOPSO: A Novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization Algorithm

2021 ◽  
Author(s):  
Ahlem Aboud ◽  
Nizar Rokbani ◽  
Raja Fdhila ◽  
Abdulrahman M. Qahtani ◽  
Omar Almutiry ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Environmental Changes ◽  
Dynamic Change ◽  
Particle Swarm ◽  
Search Space ◽  
Response Strategy ◽  
Parallel Optimization ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Multi Objective

Particle swarm optimization system based on the distributed architecture has shown its efficiency for static optimization and has not been studied to solve dynamic multiobjective problems (DMOPs). When solving DMOP, tracking the best solutions over time and ensuring good exploitation and exploration are the main challenging tasks. This study proposes a novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm including two parallel optimization levels. At the first level, all solutions are managed in a single search space. When a dynamic change is successfully detected, the Pareto ranking operator is used to enable a multiswarm subdivisions and processing which drives the second level of enhanced exploitation. A dynamic handling strategy based on random detectors is used to track the changes of the objective function due to time-varying parameters. A response strategy consisting in re-evaluate all unimproved solutions and replacing them with newly generated ones is also implemented. Inverted generational distance, mean inverted generational distance, and hypervolume difference metrics are used to assess the DPb-MOPSO performances. All quantitative results are analyzed using Friedman's analysis while the Lyapunov theorem is used for stability analysis. Compared with several multi-objective evolutionary algorithms, the DPb-MOPSO is robust in solving 21 complex problems over a range of changes in both the Pareto optimal set and Pareto optimal front. For 13 UDF and ZJZ functions, DPb-MOPSO can solve 8/13 and 7/13 on IGD and HVD with moderate changes. For the 8 FDA and dMOP benchmarks, DPb-MOPSO was able to resolve 4/8 with severe change on MIGD, and 5/8 for moderate and slight changes. However, for the 3 kind of environmental changes, DPb-MOPSO assumes 4/8 of the solving function on IGD and HVD. <br>

scholarly journals DPb-MOPSO: A Novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization Algorithm

2022 ◽  
Author(s):  
Ahlem Aboud ◽  
Nizar Rokbani ◽  
Raja Fdhila ◽  
Abdulrahman M. Qahtani ◽  
Omar Almutiry ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Environmental Changes ◽  
Dynamic Change ◽  
Particle Swarm ◽  
Search Space ◽  
Response Strategy ◽  
Parallel Optimization ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Multi Objective

Particle swarm optimization system based on the distributed architecture over multiple sub-swarms has shown its efficiency for static optimization and has not been studied to solve dynamic multi-objective problems (DMOPs). When solving DMOP, tracking the best solutions over time and ensuring good exploitation and exploration are the main challenging tasks. This study proposes a novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm including two parallel optimization levels. At the first level, all solutions are managed in a single search space. When a dynamic change is successfully detected in the objective values, the Pareto ranking operator is used to enable a multiple sub-swarm’ subdivisions and processing which drives the second level of enhanced exploitation. A dynamic handling strategy based on random detectors is used to track the changes of the objective function due to time-varying parameters. A response strategy consisting in re-evaluate all unimproved solutions and replacing them with newly generated ones is also implemented. Inverted generational distance, mean inverted generational distance, and hypervolume difference metrics are used to assess the DPb-MOPSO performances. All quantitative results are analyzed using Friedman's analysis of variance while the Lyapunov theorem is used for stability analysis. Compared with several multi-objective evolutionary algorithms, the DPb-MOPSO is robust in solving 21 complex problems over a range of changes in both the Pareto optimal set and Pareto optimal front. For 13 UDF and ZJZ functions, DPb-MOPSO can solve 8/13 and 7/13 on IGD and HVD with moderate changes. For the 8 FDA and dMOP benchmarks, DPb-MOPSO was able to resolve 4/8 with severe change on MIGD, and 5/8 for moderate and slight changes. However, for the 3 kind of environmental changes, DPb-MOPSO assumes 4/8 of the solving function on IGD and HVD metrics.<br>

Sign in / Sign up

Export Citation Format

Share Document