MCMC Sampling Statistical Method to Solve the Optimization

Abstract:

This paper designs a class of generalized density function and from which proposed a solution method for the multivariable nonlinear optimization problem based on MCMC statistical sampling. Theoretical analysis proved that the maximum statistic converge to the maximum point of probability density which establishing links between the optimization and MCMC sampling. This statistical computation algorithm demonstrates convergence property of maximum statistics in large samples and it is global search design to avoid on local optimal solution restrictions. The MCMC optimization algorithm has less iterate variables reserved so that the computing speed is relatively high. Finally, the MCMC sampling optimization algorithm is applied to solve TSP problem and compared with genetic algorithms.

• Periodical: Applied Mechanics and Materials (Volumes 121-126)
• Pages: 937-941
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.121-126.937
• Online since: October 2011
• Authors: Teng Zhong Rong, Zhi Xiao
• Keywords: Generalized Density, MCMC Sampling, Optimization Problem

References

[1] Hastions WK. Monte Carlo Sampling Methods Using Markov Chains and their Applications[J]. Biometrika, 1970(57): 97-109.

DOI: 10.1093/biomet/57.1.97

[2] Geman S, Geman D. Stochastic Relaxation, Gibbs Distributions, and The Bayesian Restoration of Images[J]. Ieee Transactions on Pattern Analysis and Machine Intelligence, 1984, 6(6): 721-741.

DOI: 10.1109/tpami.1984.4767596

[3] Brooks SP. Markov Chain Monte Carlo Method and Its Application[J]. Journal of the Royal Statistical Society. Series D (The Statistician), 1998, 47(1): 69-100.

DOI: 10.1111/1467-9884.00117

[4] Andrieu C, de FN, Doucet A. An introduction to MCMC for machine learning[J]. Machine Learning, 2003, 50(1-2): 5-43.

[5] Zhao X. ARMA Model Selection Based on Monte Carlo Markov-Chain[J]. Application of Statistics and Management, 2006(02): 161-165.

[6] CJPérez, JMartín, Rufo MJ. Sensitivity Estimations for Bayesian Inference Models Solved by MCMC Methods[J]. Reliability Engineering & System Safety, 2006, 91(10): 1310-1314.

DOI: 10.1016/j.ress.2005.11.029

[7] Wago H. Bayesian Estimation of Smooth Transition GARCH Model Using Gibbs Sampling[J]. Mathematics and Computers in Simulation, 2004, 64(1): 63-78.

DOI: 10.1016/s0378-4754(03)00121-6

[8] Duke CR, Sommerfeldt SD, Gee KL. Optimization of Control Source Locations in Free-Field Active Noise Control Using a Genetic Algorithm[J]. Noise Control Engineering Journal, 2009, 57(3): 221-231.

DOI: 10.3397/1.3081452

[9] Aghaie A, Mokhtari H. Ant colony optimization algorithm for Stochastic Project Crashing Problem in PERT Networks Using MC Simulation[J]. International Journal of Advanced Manufacturing Technology, 2009, 45(11-12): 1051-1067.

DOI: 10.1007/s00170-009-2051-6

[10] Yogeswaran M, Ponnambalam SG, Tiwari MK. An Efficient Hybrid Evolutionary Heuristic Using Genetic Algorithm and Simulated Annealing Algorithm to Solve Machine Loading Problem in FMS[J]. International Journal Of Production Research, 2009, 47(19): 5421-5448.

DOI: 10.1080/00207540801910429

[11] EYER G, CJ, HOMPSON T. Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference[M]. Alexandria, VA, ETATS-UNIS: American Statistical Association, (1995).

[12] Engebretsen L, Karpinski M: TSP with Bounded Metrics[J]. Journal of Computer and System Sciences, 2006, 72(4): 509-546.

DOI: 10.1016/j.jcss.2005.12.001