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 条
  • [1] Bayesian Monte Carlo for the Global Optimization of Expensive Functions
    Groot, Perry
    Birlutiu, Adriana
    Heskes, Tom
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 249 - 254
  • [2] An Efficient Optimization of the Monte Carlo Tree Search Algorithm for Amazons
    Zhang, Lijun
    Zou, Han
    Zhu, Yungang
    ALGORITHMS, 2024, 17 (08)
  • [3] A feedback algorithm for determining search parameters for Monte Carlo optimization
    Morey, C
    Scales, J
    Van Vleck, ES
    JOURNAL OF COMPUTATIONAL PHYSICS, 1998, 146 (01) : 263 - 281
  • [4] LOCALIZATION OF SEARCH IN QUASI-MONTE-CARLO METHODS FOR GLOBAL OPTIMIZATION
    NIEDERREITER, H
    PEART, P
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1986, 7 (02): : 660 - 664
  • [5] A DIRECT SEARCH ALGORITHM FOR GLOBAL OPTIMIZATION OF MULTIVARIATE FUNCTIONS
    BENKE, KK
    SKINNER, DR
    AUSTRALIAN COMPUTER JOURNAL, 1991, 23 (02): : 73 - 85
  • [6] Adaptive random search in quasi-Monte Carlo methods for global optimization
    Lei, GY
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2002, 43 (6-7) : 747 - 754
  • [7] Monte Carlo dynamics in global optimization
    Chen, CN
    Chou, CI
    Hwang, CR
    Kang, J
    Lee, TK
    Li, SP
    PHYSICAL REVIEW E, 1999, 60 (02): : 2388 - 2393
  • [8] A GENERALIZED GUIDED MONTE-CARLO ALGORITHM
    HOROWITZ, AM
    PHYSICS LETTERS B, 1991, 268 (02) : 247 - 252
  • [9] A guided Monte Carlo approach to optimization problems
    Chou, CI
    Han, RS
    Lee, TK
    Li, SP
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, 2003, 2690 : 447 - 451
  • [10] A guided Monte Carlo method for optimization problems
    Li, SP
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2002, 13 (10): : 1365 - 1374