.png){kind=icon}
Return
Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.10.020.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The class of generalized pattern search (GPS) algorithms for mixed variable optimization is extended to problems with stochastic objective functions. Because random noise in the objective function makes it more difficult to compare trial points and ascertain which points are truly better than others, replications are needed to generate sufficient statistical power to draw conclusions. Rather than comparing pairs of points, the approach taken here augments pattern search with a ranking and selection (R&S) procedure, which allows for comparing many function values simultaneously. Asymptotic convergence for the algorithm is established, numerical issues are discussed, and performance of the algorithm is studied on a set of test problems. Published by Elsevier B.V.
Keywords:
Pattern search algorithms
Mixed variable programming
Nonlinear programming
Simulation
Ranking and selection
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations
Cited Papers
Complex regulation of the TaMyc1 gene expression in wheat grain synthesizing anthocyanin pigments
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSave View more