Enhanced Tunicate Swarm Algorithm for Solving Large-Scale Nonlinear Optimization Problems
Nowadays optimization problems become difficult and complex, traditional methods become inefficient to reach global optimal solutions. Meanwhile, a huge number of meta-heuristic algorithms have been suggested to overcome the shortcomings of traditional methods. Tunicate Swarm Algorithm (TSA) is a ne...
Gespeichert in:
Veröffentlicht in: | International journal of computational intelligence systems 2021-12, Vol.14 (1), Article 189 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Nowadays optimization problems become difficult and complex, traditional methods become inefficient to reach global optimal solutions. Meanwhile, a huge number of meta-heuristic algorithms have been suggested to overcome the shortcomings of traditional methods. Tunicate Swarm Algorithm (TSA) is a new biologically inspired meta-heuristic optimization algorithm which mimics jet propulsion and swarm intelligence during the searching for a food source. In this paper, we suggested an enhancement to TSA, named Enhanced Tunicate Swarm Algorithm (ETSA), based on a novel searching strategy to improve the exploration and exploitation abilities. The proposed ETSA is applied to 20 unimodal, multimodal and fixed dimensional benchmark test functions and compared with other algorithms. The statistical measures, error analysis and the Wilcoxon test have affirmed the robustness and effectiveness of the ETSA. Furthermore, the scalability of the ETSA is confirmed using high dimensions and results exhibited that the ETSA is least affected by increasing the dimensions. Additionally, the CPU time of the proposed algorithms are obtained, the ETSA provides less CPU time than the others for most functions. Finally, the proposed algorithm is applied at one of the important electrical applications, Economic Dispatch Problem, and the results affirmed its applicability to deal with practical optimization tasks. |
---|---|
ISSN: | 1875-6883 1875-6883 |
DOI: | 10.1007/s44196-021-00039-4 |