2019
DOI: 10.1016/j.asoc.2019.03.011
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Chaotic Gravitational Search Algorithm for unconstrained global optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
10

Relationship

2
8

Authors

Journals

citations
Cited by 46 publications
(21 citation statements)
references
References 62 publications
0
21
0
Order By: Relevance
“…The goal of the optimisation algorithm is to determine the best parameter values of the system under different conditions (Ahmed et al, 2016). Recently, the gravitational search algorithm (GSA) proposed by Rashedi et al (2009) has been applied to tackle various optimisation issues such as unconstrained global optimisation problems (García-Ródenas et al, 2019), hydrology (Karami et al, 2019) and in the geothermal power plant optimisation (Özkaraca and Keçebaş, 2019). Particle Swarm Optimisation (PSO) algorithm has been used in different fields such as sediment yield forecasting (Meshram et al, 2019), operation rule derivation of hydropower reservoir (Feng et al, 2019) and semi-supervised data clustering (Lai et al, 2019).…”
Section: Introductionmentioning
confidence: 99%
“…The goal of the optimisation algorithm is to determine the best parameter values of the system under different conditions (Ahmed et al, 2016). Recently, the gravitational search algorithm (GSA) proposed by Rashedi et al (2009) has been applied to tackle various optimisation issues such as unconstrained global optimisation problems (García-Ródenas et al, 2019), hydrology (Karami et al, 2019) and in the geothermal power plant optimisation (Özkaraca and Keçebaş, 2019). Particle Swarm Optimisation (PSO) algorithm has been used in different fields such as sediment yield forecasting (Meshram et al, 2019), operation rule derivation of hydropower reservoir (Feng et al, 2019) and semi-supervised data clustering (Lai et al, 2019).…”
Section: Introductionmentioning
confidence: 99%
“…The problem (5) may contain many local minima and optimizers such as metaheuristics may be good choices to address it. These methods have been developed intensively for unconstrained optimization (García- Ródenas et al 2019) leading to the consideration of another way to scalarize a bi-objective optimization problem. Assuming that the exploitation measure satisfies w X (y) > 0 for all y ∈ D , the following sampling problem is stated:…”
Section: Bi-objective Infill Sampling Criterionmentioning
confidence: 99%
“…This algorithm is called the Simulated Annealing (SA) method, which has been utilized to determine the parameters of the SD and DD model of SC and PV modules. Moreover, it has been demonstrated that the meta-heuristic (MH) optimization techniques allow building an effective PV modulator according to various criteria such as precision, consistency, convergence speed, calculation efficiency and the reduced number of control parameters [23,[27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42]. These algorithms can be classified into four categories, evolutionary algorithms (Genetic Algorithm (GA), differential Evolution (DE), and Confidence-Weighted (SCW), physics-based algorithms (Wind Driven Optimization (WDO), Flower Pollination Algorithm (FPA), and Gravitational Search Algorithm (GSA)), swarm-based algorithms (Artificial bee colony (ABC), particle swarm optimization (PSO), Cat Swarm Optimization (CSO), Whale Optimization Algorithm (WOA), improved whale optimization algorithm (IWOA), a performance-guided JAYA (PGJAYA), Chaotic Heterogeneous Comprehensive Learning Particle Swarm Optimizer (C-HCLPSO), Improved Lozi Map based Chaotic Optimization Algorithm (ILCOA), biogeography-based heterogeneous cuckoo search (BHCS) algorithm, and symbiotic organisms search (SOS) algorithm), and human-based algorithms (HBA).…”
Section: Introductionmentioning
confidence: 99%