PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 13, 2023Mathematics42 citationsOpen Access

A Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems

JPJeng‐Shyang PanBSBing SunSCShu‐Chuan Chu

Key Points

Key points are not available for this paper at this time.

Abstract

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Pan et al. (2023) studied this question.

synapsesocial.com/papers/6a72a48e5d37378ac1df54b7https://doi.org/10.3390/math11020439
Ask AI
Helpful
Bookmark
Share
View Full Paper