2007
DOI: 10.1016/j.ejor.2006.06.034
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid simplex search and particle swarm optimization for unconstrained optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
120
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 298 publications
(126 citation statements)
references
References 19 publications
0
120
0
Order By: Relevance
“…Normalization of input data is necessary for obtaining correct trigonometric expansion. ( 1 (38) The symbol N is the total number of data patterns. T i and T i ' represent the actual value and prediction at time i.…”
Section: Data Preprocessingmentioning
confidence: 99%
See 1 more Smart Citation
“…Normalization of input data is necessary for obtaining correct trigonometric expansion. ( 1 (38) The symbol N is the total number of data patterns. T i and T i ' represent the actual value and prediction at time i.…”
Section: Data Preprocessingmentioning
confidence: 99%
“…In order to reduce the opportunity of trapping in a local optimum, expand the search scope of the algorithm and enhance the algorithm's climbing ability, it is certainly critical to always maintain the diversity of particles. The existing algorithms such as chaos mechanism optimization [37], hybrid simplex search PSO [38], comprehensive learning PSO, dynamic random search technique [39] are difficult to solve the two problems (global optimization and premature convergence) simultaneously. Therefore, we design an improved particle swarm optimization (IPSO) with adaptive nonlinear inertia weight and dynamic arccosine function acceleration parameters.…”
Section: The Improved Particle Swarm Optimization Algorithmmentioning
confidence: 99%
“…In fact, the results showed that the hybrid algorithm had faster convergence, higher accuracy and was more effective for solving constrained engineering optimization problems (Luo and Zhang, 2011). Hybrid PSO optimization has also been widely applied (Shieh et al, 2011;Valdez et al, 2011;Fan and Zahara, 2007;Ahandania et al, 2012;Li et al, 2009;Wang et al, 2013) demonstrating faster convergence rates. Likewise, ACO was improved by incorporating a hybridization strategy (Chen et al, 2012;Koide et al, 2013).…”
Section: Introductionmentioning
confidence: 86%
“…Third, the domain of permissible solutions is not limited to variables satisfying some equality or inequality constraints, therefore it is an unconstrained problem. In the literature, there are many methods and algorithms developed to solve the multidimensional unconstrained non-linear problem, such as Newton's method, Broyden's method (Broyden 1965), line-search methods, trust-region methods (Celis, Dennis, and Tapia 1985), the Nelder-Mead simplex method (Nelder and Mead 1965), the conjugate-gradient method (Hestenes and Stiefel 1952) and their variants (Fan and Zahara 2007;Birgin and Martinez 2001). Most of these algorithms involve an iterative process that converges on a sufficiently accurate solution.…”
Section: Multidimensional Unconstrained Non-linear Minimizationmentioning
confidence: 99%