No abstract

In this paper, a novel swarm-based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank-sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms.

We propose a new strategy to design broadband and wide angle diffusion metasurfaces. An anisotropic structure which has opposite phases under x- and y-polarized incidence is employed as the “0” and “1” elements base on the concept of coding metamaterial. To obtain a uniform backward scattering under normal incidence, Simulated Annealing algorithm is utilized in this paper to calculate the optimal layout. The proposed method provides an efficient way to design diffusion metasurface with a simple structure, which has been proved by both simulations and measurements.

No abstract

Meta-heuristic algorithms have gained substantial popularity in recent decades and have focused on applications in a wide spectrum of fields. In this paper, a new and powerful physics-based algorithm named nuclear reaction optimization (NRO) is presented. Meanwhile, NRO imitates the nuclear reaction process and consists of two phases, namely, a nuclear fission (NFi) phase and a nuclear fusion (NFu) phase. The Gaussian walk and differential evolution operators between nucleus and neutron are employed for exploitation and appropriate exploration in the (NFi) phase, respectively. Meanwhile, the variants of differential evolution operator are utilized for exploration in the NFu phase, which consists of the ionization and fusion stages. Additionally, variants of Levy flight are used for random searching to escape from the local optima in each stage of NFu phase. The exploration and exploitation abilities of NRO can be balanced due to a combination of the two phases. Both constrained and unconstrained benchmark functions are employed for testing the performance of NRO. To make comparisons between NRO and the state-of-the-art algorithms, twenty-three classic benchmark functions and twenty-night modern benchmark functions are performed. Moreover, three engineering design optimization problems are solved as constrained benchmark functions by using NRO and the compared algorithms. The results illustrate that the proposed nuclear reaction optimization algorithm is a potential and powerful approach for global optimization.