Design of optimal low-pass filter by a new Levy swallow swarm algorithm

Abstract

The swallow swarm optimization (SS) is a challenging method of optimization, which has a quicker convergence speed, not getting caught in the local extreme points. However, the SS suffers from a few shortcomings—(1) the movement speed of particles is not controlled suitably during the search due to the requirement of an inertia weight and (2) the less flexibility of variables does not permit to maintain a balance between the local and the global searches. To solve these problems, a new Levy swallow swarm optimization (SSLY) algorithm with the exploitation capability is proposed. This article also provides an optimal design methodology for the low-pass filter using the suggested SSLY technique. A new objective function is introduced to achieve the maximally flat frequency response, which is another important contribution to the field. The firefly algorithm (FA), the sine cosine algorithm (SCA) and the standard global optimizers—real coded genetic algorithm (GA), conventional particle swarm optimization (PSO), cuckoo search (CS) and SS, are considered for a comparison. The proposed SSLY outperforms the FA, SCA, GA, PSO, CS and SS algorithms. Results authenticate suitability of the proposed algorithm for solving the filter design problems in the FIR domain.