Comparison of Meta-Heuristic Algorithms on Benchmark Functions

No Thumbnail Available

Date

2019

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Open Access Color

GOLD

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Top 10%

Research Projects

Journal Issue

Abstract

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Description

Keywords

Mühendislik Temel Alanı>Bilgisayar Bilimleri ve Mühendisliği>Yapay Zeka>Yapay Öğrenme, Metaheuristic Algorithms, Optimization

Turkish CoHE Thesis Center URL

Fields of Science

0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Citation

WoS Q

N/A

Scopus Q

N/A
OpenCitations Logo
OpenCitations Citation Count
6

Source

Academic Perspective

Volume

2

Issue

2

Start Page

508

End Page

517
PlumX Metrics
Captures

Mendeley Readers : 13

Downloads

2

checked on Feb 03, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.61447098

Sustainable Development Goals

SDG data could not be loaded because of an error. Please refresh the page or try again later.