View in EDS

Opposition-Based Chaotic Tunicate Swarm Algorithms for Global Optimization

Saved in:
Bibliographic Details
Title: Opposition-Based Chaotic Tunicate Swarm Algorithms for Global Optimization
Authors: Tapas Si, Péricles B. C. Miranda, Utpal Nandi, Nanda Dulal Jana, Saurav Mallik, Ujjwal Maulik, Hong Qin
Source: IEEE Access, Vol 12, Pp 18168-18188 (2024)
Publisher Information: Institute of Electrical and Electronics Engineers (IEEE), 2024.
Publication Year: 2024
Subject Terms: swarm intelligence, Tunicate swarm algorithm, 0202 electrical engineering, electronic engineering, information engineering, metaheuristic, opposition-based learning, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, TK1-9971
Description: Tunicate Swarm Algorithm (TSA) is a novel swarm intelligence algorithm developed in 2020. Though it has shown superior performance in numerical benchmark function optimization and six engineering design problems over its competitive algorithms, it still needs further improvements. This article proposes two improved TSA algorithms using chaos theory, opposition-based learning (OBL) and Cauchy mutation. The proposed algorithms are termed OCSTA and COCSTA. The static and dynamic OBL are used respectively in the initialization and generation jumping phase of OCTSA, whereas centroid opposition-based computing is used, in the same phases, in COCTSA. The proposed algorithms are tested on 30 IEEE CEC2017 benchmark optimization problems consists of unimodal, multimodal, hybrid, and composite functions with 30, 50, and 100 dimensions. The experimental results are compared with the classical TSA, TSA with the local escaping operator (TSA-LEO), Sine Cosine Algorithm (SCA), Giza-Pyramid Construction Algorithm (GPC), Covariance Matrix Adaptation Evolution Strategy (CMAES), Archimedes Optimization Algorithm (AOA), Opposition-Based Arithmetic Optimization Algorithm (OBLAOA), and Opposition-Based Chimp Optimization Algorithm (ChOAOBL). The statistical analysis of experimental results using the Wilcoxon Signed Rank Test establishes that the proposed algorithms outperform TSA and other algorithms for most of the problems. Moreover, high dimensions are used to validate the scalability of OCTSA and COCTSA, and the results show that the modified TSA algorithms are least impacted by larger dimensions. The experimental results with statistical analysis demonstrate the effectiveness of the proposed algorithms in solving global optimization problems.
Document Type: Article
ISSN: 2169-3536
DOI: 10.1109/access.2024.3359587
Access URL: https://doaj.org/article/c7186754937342d4930e2bde69e90e21
Rights: CC BY NC ND
Accession Number: edsair.doi.dedup.....a6d367f9d7b8adcb029ab6b87c3ec63b
Database: OpenAIRE
Description
Abstract:Tunicate Swarm Algorithm (TSA) is a novel swarm intelligence algorithm developed in 2020. Though it has shown superior performance in numerical benchmark function optimization and six engineering design problems over its competitive algorithms, it still needs further improvements. This article proposes two improved TSA algorithms using chaos theory, opposition-based learning (OBL) and Cauchy mutation. The proposed algorithms are termed OCSTA and COCSTA. The static and dynamic OBL are used respectively in the initialization and generation jumping phase of OCTSA, whereas centroid opposition-based computing is used, in the same phases, in COCTSA. The proposed algorithms are tested on 30 IEEE CEC2017 benchmark optimization problems consists of unimodal, multimodal, hybrid, and composite functions with 30, 50, and 100 dimensions. The experimental results are compared with the classical TSA, TSA with the local escaping operator (TSA-LEO), Sine Cosine Algorithm (SCA), Giza-Pyramid Construction Algorithm (GPC), Covariance Matrix Adaptation Evolution Strategy (CMAES), Archimedes Optimization Algorithm (AOA), Opposition-Based Arithmetic Optimization Algorithm (OBLAOA), and Opposition-Based Chimp Optimization Algorithm (ChOAOBL). The statistical analysis of experimental results using the Wilcoxon Signed Rank Test establishes that the proposed algorithms outperform TSA and other algorithms for most of the problems. Moreover, high dimensions are used to validate the scalability of OCTSA and COCTSA, and the results show that the modified TSA algorithms are least impacted by larger dimensions. The experimental results with statistical analysis demonstrate the effectiveness of the proposed algorithms in solving global optimization problems.
ISSN:21693536
DOI:10.1109/access.2024.3359587