Adaptive evolutionary Monte Carlo algorithm for optimization with applications to sensor placement problems Academic Article uri icon


  • In this paper, we present an adaptive evolutionary Monte Carlo algorithm (AEMC), which combines a tree-based predictive model with an evolutionary Monte Carlo sampling procedure for the purpose of global optimization. Our development is motivated by sensor placement applications in engineering, which requires optimizing certain complicated "black-box" objective function. The proposed method is able to enhance the optimization efficiency and effectiveness as compared to a few alternative strategies. AEMC falls into the category of adaptive Markov chain Monte Carlo (MCMC) algorithms and is the first adaptive MCMC algorithm that simulates multiple Markov chains in parallel. A theorem about the ergodicity property of the AEMC algorithm is stated and proven. We demonstrate the advantages of the proposed method by applying it to a sensor placement problem in a manufacturing process, as well as to a standard Griewank test function. 2008 Springer Science+Business Media, LLC.

published proceedings


author list (cited authors)

  • Ren, Y., Ding, Y. u., & Liang, F.

citation count

  • 10

complete list of authors

  • Ren, Yuan||Ding, Yu||Liang, Faming

publication date

  • December 2008