2016
DOI: 10.1016/j.engappai.2016.01.034
|View full text |Cite
|
Sign up to set email alerts
|

A new optimization algorithm based on chaotic maps and golden section search method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0
2

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 96 publications
(38 citation statements)
references
References 61 publications
0
36
0
2
Order By: Relevance
“…Experimental results show that the proposed golden section search method is valuable and gives a reasonable shape parameter beside satisfactory precision of the solution. Koupaei, et al (2016) proposed a practical version of golden section search algorithm to optimize objective functions. Consequently, their work presented an algorithm takes the benefits and capabilities for both of chaotic maps and the golden section search method in order to solve nonlinear optimization problems.…”
Section: Related Workmentioning
confidence: 99%
“…Experimental results show that the proposed golden section search method is valuable and gives a reasonable shape parameter beside satisfactory precision of the solution. Koupaei, et al (2016) proposed a practical version of golden section search algorithm to optimize objective functions. Consequently, their work presented an algorithm takes the benefits and capabilities for both of chaotic maps and the golden section search method in order to solve nonlinear optimization problems.…”
Section: Related Workmentioning
confidence: 99%
“…What is more, the forecasting process of this method (which is used to determine the smooth coefficient by the empirical estimation and trial-anderror methods) needs human intervention and thus has low automation and is an inefficient solving method. To overcome the drawback of the above two methods, the 0.618 method [28] can be used to search for the optimal smooth coefficient. However, the optimum result of the 0.618 method depends mainly on the objective function chosen.…”
Section: The Exponential Smoothing Methodmentioning
confidence: 99%
“…However, weak local search ability of CSO limits its optimization performance; hence CSO can be improved by combining the strong search ability of other algorithms. Chaotic systems are famous for inherent ergodicity, irregularity, and pseudorandomness; these basic traits make it perform better than random operators in local searching [26]. Chaotic systems search extensively for solutions and can find a desirable solution within a practical time.…”
Section: Introductionmentioning
confidence: 99%