ASCA-PSO: Adaptive sine cosine optimization algorithm integrated with particle swarm for pairwise local sequence alignment. (1st June 2018)

• Record Type: Journal Article
• Authors: Issa, Mohamed; Hassanien, Aboul Ella; Oliva, Diego; Helmi, Ahmed; Ziedan, Ibrahim; Alzohairy, Ahmed
• Is Part Of: Expert systems with applications. Volume 99(2018)
• Page Start: 56
• Page End: 70
• Publication Date: 2018-06-01
• Subjects: Sine cosine algorithm (SCA) -- Particle swarm optimization (PSO) -- Meta-heuristics algorithms -- Pairwise local alignment -- Longest consecutive substrings -- Smith-Waterman alignment algorithm; Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2018.01.019
• Languages: English
• ISSNs: 0957-4174

Abstract

Highlights: Sine cosine algorithm is enhanced by hybridizing particle swarm optimization. The hybridization is based on low level co-evolutionary hybrid scheme. The proposed scheme produced better performance on mathematical benchmark functions. Finding longest consecutive substring problem was used as testing case study. Abstract: The sine cosine algorithm (SCA), a recently proposed population-based optimization algorithm, is based on the use of sine and cosine trigonometric functions as operators to update the movements of the search agents. To optimize performance, different parameters on the SCA must be appropriately tuned. Setting such parameters is challenging because they permit the algorithm to escape from local optima and avoid premature convergence. The main drawback of the SCA is that the parameter setting only affects the exploitation of the prominent regions. However, the SCA has good exploration capabilities. This article presents an enhanced version of the SCA by merging it with particle swarm optimization (PSO). PSO exploits the search space better than the operators of the standard SCA. The proposed algorithm, called ASCA-PSO, has been tested over several unimodal and multimodal benchmark functions, which show its superiority over the SCA and other recent and standard meta-heuristic algorithms. Moreover, to verify the capabilities of the SCA, the SCA has been used to solve the real-world problem of a pairwise local alignment algorithm that tends to find the longest consecutive substrings between two biological sequences. Experimental results provide evidence of the good performance of the ASCA-PSO solutions in terms of accuracy and computational time.