.png){kind=icon}
Return
Simulation-based optimization using simulated annealing with ranking and selection
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(00)00073-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a new iterative method that combines the simulated annealing method and the ranking and selection procedures for solving discrete stochastic optimization problems. The number of visit to every state by the proposed algorithm is used to estimate the optimal solution. We show that the configuration that has been visited most often in the first m iterations converges almost surely to a globally optimum solution. We present empirical results that illustrate the performance of the proposed method.
Keywords:
stochastic optimization
Markov chains
simulation
ranking and selection
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveEffect of quinoa diet on postprandial blood glucose in patients with type 2 diabetes mellitus.png)
IF0
PREAI
ShareSaveShareSaveShareSaveBiosynthesis of the erythromycin macrolactone and a rational approach for producing hybrid macrolidesGene
GeneIF0
PREAI
ShareSave
no more
no more