2014
DOI: 10.1016/j.jocs.2013.10.007
|View full text |Cite
|
Sign up to set email alerts
|

Ensemble mutable smart bee algorithm and a robust neural identifier for optimal design of a large scale power system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
8

Relationship

4
4

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 41 publications
0
10
0
Order By: Relevance
“…employed bee phase, onlooker bee phase and mutation phase. Recently, Mozaffari et al [65] reviewed the advances and modifications related to MSBA, and also provided a literature review on the applications of MSBA for real-life problems. The pseudo-code of MSBA is given in Algorithm 3.…”
Section: Mutable Smart Bee Algorithmmentioning
confidence: 99%
“…employed bee phase, onlooker bee phase and mutation phase. Recently, Mozaffari et al [65] reviewed the advances and modifications related to MSBA, and also provided a literature review on the applications of MSBA for real-life problems. The pseudo-code of MSBA is given in Algorithm 3.…”
Section: Mutable Smart Bee Algorithmmentioning
confidence: 99%
“…They proved that the method is best suit for coping with difficulties and constraints of the optimisation problem. Recently, an ensemble version of MSBA has been proposed for optimising a large-scale power system under uncertainty (Mozaffari, Azimi, & Gorji-Bandpy, 2013). Based on a comparative study, the authenticity of ensemble MSBA for optimising large-scale optimisation problems has been proved.…”
Section: The Proposed Intelligent Analysing Tool 41 Mutable Smart Bementioning
confidence: 99%
“…The authors' experiences demonstrate that the AGS mutation operator is very effective for optimizing multimodal and difficult problems [27,28]. The AGS operator is mathematically expressed as follows:…”
Section: Mutation Operatormentioning
confidence: 99%
“…In fact, the time complexity analysis demonstrates which types of chaotic maps are more computationally efficient, and also lets us understand whether they are more parsimonious in comparison to the standard variants of GAs. In a previous work by the authors, it has been observed that the time complexity is a proper metric for evaluating the complexity of the methods[27].The mathematical formulations required for calculating the time complexity are given belowis the code execution time for 200000 evaluations of the programming operators, namely %, , +, -, ^, /, exp, and ln, for a simple 2 dimensional vector, 1  is the required time for 200000 function evaluations and 2  is the mean of 30 execution times.…”
mentioning
confidence: 99%