The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2017
DOI: 10.4172/2090-4908.1000165
|View full text |Cite
|
Sign up to set email alerts
|

Application of Grasshopper Optimization Algorithm for Constrained and Unconstrained Test Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 29 publications
(19 citation statements)
references
References 14 publications
0
19
0
Order By: Relevance
“…It has been reported that GOA is capable to solve almost all types of problems efficiently. In [47] , [48] , [49] , [50] , the authors applied GOA to solve various problems. The results demonstrate the superiority of GOA in comparison with the tasted algorithms.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…It has been reported that GOA is capable to solve almost all types of problems efficiently. In [47] , [48] , [49] , [50] , the authors applied GOA to solve various problems. The results demonstrate the superiority of GOA in comparison with the tasted algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…In the present research, GOA has been applied to optimally place multiple ONUs in the FiWi access network. In [23] , [47] , [48] , [49] , [50] , GOA has been used for solving several problems in engineering and application. Further in [23] , the authors proposed GOA and accomplished the performance analysis of GOA.…”
Section: Related Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…In which, the number of grasshoppers involved in the population is indicated as N . A good metaheuristic algorithm should determine the optimal solution with better balanced exploitation and exploration process 37 . During different exploration and exploitation phases, the mathematical model achieved is expressed as follows: Xid=c()j=1,jiNcUdLd2s()xjdxidxjxiditalicij+Td where the upper bound and lower bound variables in d th dimension is represented as U d and L d .…”
Section: Proposed Approachmentioning
confidence: 99%
“…The SVM-CBO approach has been validated on three well-known 2D test functions for CGO, that are: Rosenbrock constrained to a disk [55], Rosenbrock constrained to a line and a cubic [55,56], and Mishra's Bird constrained [57]. Since these test functions are all constrained to just one connected feasible region, two more supplementary test functions have been defined: Branin (rescaled) [58] constrained to an ellipse and Branin (rescaled) constrained on two disconnected ellipses.…”
Section: Simple 2d Test Functionsmentioning
confidence: 99%