A guided Monte Carlo search algorithm for global optimization of multidimensional functions?

被引:4
|
作者
Delgoda, R [1 ]
Pulfer, JD [1 ]
机构
[1] Univ Warwick, Dept Biol Sci, Coventry CV4 7AL, W Midlands, England
关键词
D O I
10.1021/ci9701042
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The high efficiency of the Monte Carlo optimization algorithm developed by Pulfer and Waine(14) is due to the discovery of a novel sampler that combines randomized guided step sizes with a random direction search strategy. We modified this algorithm to use a preset number of optimally sequenced steps to bound the randomly chosen step length. This has the effect of both spanning the response surface rapidly and escaping local optima efficiently. Coupled to changes in both sampling strategy and termination criteria, the resulting guided Monte Carlo (GMC) numerical search algorithm is shown to solve the global optimization problem effectively. Fifteen multidimensional benchmark test functions having differing characteristics such as numerous local optima or very sharp optima, very shallow optima, variables with differing influence over the function, and high dimensionality, were used to test the efficacy of the GMC algorithm. It was successful in solving them all, with a majority converging 100% of the time out of 1000 independent runs within highly competitive computer processing times when compared to contemporary efficient algorithms. For example, when the highly intractable five dimensional shekel function was-solved by Fagiuoli:et al.'s(20) sampling algorithm, it required 2514 function evaluations (f.e.) and 7. shekels of computer time to find the global optimum with a success rate of 900 out of 1000 independent runs, whereas the GMC algorithm needed only 519 f.e. and 1.66 shekels to achieve-the same accuracy with the same probability of success. A multirun routine has also been incorporated into the GMC algorithm to enable users to repeatedly test the response surface to achieve almost 100% certainty. Also, the GMC algorithm successfully solved the 100 dimensional cosine mixture test function, known to have numerous shallow local optima and one global optimum. This indicates its potential to solve practical problems such as those associated with protein configuration analysis.
引用
收藏
页码:1087 / 1095
页数:9
相关论文
共 50 条
  • [21] Local optimization method with global multidimensional search
    Bagirov, AM
    Rubinov, AM
    Zhang, JP
    JOURNAL OF GLOBAL OPTIMIZATION, 2005, 32 (02) : 161 - 179
  • [22] FLEET OPTIMIZATION BASED ON THE MONTE CARLO ALGORITHM
    Lampa, Martin
    Samolejova, Andrea
    ACTA LOGISTICA, 2020, 7 (01): : 17 - 21
  • [23] GFS Algorithm Based on Batch Monte Carlo Trials for Solving Global Optimization Problems
    Popkov, Yuri S.
    Darkhovskiy, Boris S.
    Popkov, Alexey Y.
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA-2016), 2016, 1776
  • [24] An adaptively weighted stochastic gradient MCMC algorithm for Monte Carlo simulation and global optimization
    Wei Deng
    Guang Lin
    Faming Liang
    Statistics and Computing, 2022, 32
  • [25] Adaptive Monte Carlo Algorithm to Global Radio Resources Optimization in H-CRAN
    Schimuneck, Matias A. K.
    Kist, Maicon
    Rochol, Juergen
    Ribeiro-Teixeira, Ana Carolina
    Both, Cristiano Bonato
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [26] An adaptively weighted stochastic gradient MCMC algorithm for Monte Carlo simulation and global optimization
    Deng, Wei
    Lin, Guang
    Liang, Faming
    STATISTICS AND COMPUTING, 2022, 32 (04)
  • [27] A flexible and adaptive grid algorithm for global optimization utilizing basin hopping Monte Carlo
    Paleico, Martin Leandro
    Behler, Joerg
    JOURNAL OF CHEMICAL PHYSICS, 2020, 152 (09):
  • [28] A Parallel Monte-Carlo Tree Search Algorithm
    Cazenave, Tristan
    Jouandeau, Nicolas
    COMPUTERS AND GAMES, 2008, 5131 : 72 - 80
  • [29] PURE ADAPTIVE SEARCH IN MONTE-CARLO OPTIMIZATION
    PATEL, NR
    SMITH, RL
    ZABINSKY, ZB
    MATHEMATICAL PROGRAMMING, 1989, 43 (03) : 317 - 328
  • [30] Monte-Carlo Tree Search for Policy Optimization
    Ma, Xiaobai
    Driggs-Campbell, Katherine
    Zhang, Zongzhang
    Kochenderfer, Mykel J.
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 3116 - 3122