首页   按字顺浏览 期刊浏览 卷期浏览 An Overview of Mean Field Theory in Combinatorial Optimization Problems
An Overview of Mean Field Theory in Combinatorial Optimization Problems

 

作者: Suat Kasap,   Theodore B. Trafalis,  

 

期刊: AIP Conference Proceedings  (AIP Available online 1904)
卷期: Volume 729, issue 1  

页码: 339-346

 

ISSN:0094-243X

 

年代: 1904

 

DOI:10.1063/1.1814748

 

出版商: AIP

 

数据来源: AIP

 

摘要:

In the last three decades, there has been significant interest in using mean field theory of statistical physics for combinatorial optimization. This has led to the development of powerful optimization techniques such as neural networks (NNs), simulated annealing (SA), and mean field annealing (MFA). MFA replaces the stochastic nature of SA with a set of deterministic equations named as mean field equations. The mean field equations depend on the energy function of the NNs and are solved at each temperature during the annealing process of SA. MFA advances to the optimal solution in a fundamentally different way than stochastic methods. The use of mean field techniques for the combinatorial optimization problems are reviewed in this study. © 2004 American Institute of Physics

 

点击下载:  PDF (264KB)



返 回