A Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems

The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved Gannet Optimization Algorithm is proposed to solve five engineering optimization problems. The compact strategy enables the GOA to s...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) Vol. 11; no. 2; p. 439
Main Authors: Pan, Jeng-Shyang, Sun, Bing, Chu, Shu-Chuan, Zhu, Minghui, Shieh, Chin-Shiuh
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.01.2023
Subjects:
Algorithms
Communication
compact strategy
Efficiency
Engineering
engineering optimization
Gannet Optimization Algorithm
Optimization
Optimization algorithms
parallel communication strategy
Predation
Principles
ISSN:2227-7390, 2227-7390
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved Gannet Optimization Algorithm is proposed to solve five engineering optimization problems. The compact strategy enables the GOA to save a large amount of memory, and the parallel communication strategy allows the algorithm to avoid falling into local optimal solutions. We improve the GOA through the combination of parallel strategy and compact strategy, and we name the improved algorithm Parallel Compact Gannet Optimization Algorithm (PCGOA). The performance study of the PCGOA on the CEC2013 benchmark demonstrates the advantages of our new method in various aspects. Finally, the results of the PCGOA on solving five engineering optimization problems show that the improved algorithm can find the global optimal solution more accurately.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math11020439