共查询到10条相似文献,搜索用时 125 毫秒
1.
On the Convergence of the Cross-Entropy Method 总被引:5,自引:0,他引:5
The cross-entropy method is a relatively new method for combinatorial optimization. The idea of this method came from the
simulation field and then was successfully applied to different combinatorial optimization problems. The method consists of
an iterative stochastic procedure that makes use of the importance sampling technique. In this paper we prove the asymptotical
convergence of some modifications of the cross-entropy method. 相似文献
2.
In this paper, we propose a new integral global optimization algorithm for finding the solution of continuous minimization problem, and prove the asymptotic convergence of this algorithm. In our modified method we use variable measure integral, importance sampling and main idea of the cross-entropy method to ensure its convergence and efficiency. Numerical results show that the new method is very efficient in some challenging continuous global optimization problems. 相似文献
3.
An Efficient Algorithm for Rare-event Probability Estimation,Combinatorial Optimization,and Counting 总被引:1,自引:0,他引:1
Zdravko I. Botev Dirk P. Kroese 《Methodology and Computing in Applied Probability》2008,10(4):471-505
Although importance sampling is an established and effective sampling and estimation technique, it becomes unstable and unreliable
for high-dimensional problems. The main reason is that the likelihood ratio in the importance sampling estimator degenerates
when the dimension of the problem becomes large. Various remedies to this problem have been suggested, including heuristics
such as resampling. Even so, the consensus is that for large-dimensional problems, likelihood ratios (and hence importance
sampling) should be avoided. In this paper we introduce a new adaptive simulation approach that does away with likelihood
ratios, while retaining the multi-level approach of the cross-entropy method. Like the latter, the method can be used for
rare-event probability estimation, optimization, and counting. Moreover, the method allows one to sample exactly from the
target distribution rather than asymptotically as in Markov chain Monte Carlo. Numerical examples demonstrate the effectiveness
of the method for a variety of applications.
相似文献
4.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
5.
6.
Reuven Rubinstein 《Methodology and Computing in Applied Probability》2009,11(4):491-549
We present a randomized algorithm, called the cloning algorithm, for approximating the solutions of quite general NP-hard
combinatorial optimization problems, counting, rare-event estimation and uniform sampling on complex regions. Similar to the
algorithms of Diaconis–Holmes–Ross and Botev–Kroese the cloning algorithm is based on the MCMC (Gibbs) sampler equipped with
an importance sampling pdf and, as usual for randomized algorithms, it uses a sequential sampling plan to decompose a “difficult”
problem into a sequence of “easy” ones. The cloning algorithm combines the best features of the Diaconis–Holmes–Ross and the
Botev–Kroese. In addition to some other enhancements, it has a special mechanism, called the “cloning” device, which makes
the cloning algorithm, also called the Gibbs cloner fast and accurate. We believe that it is the fastest and the most accurate randomized algorithm for counting known so far.
In addition it is well suited for solving problems associated with the Boltzmann distribution, like estimating the partition
functions in an Ising model. We also present a combined version of the cloning and cross-entropy (CE) algorithms. We prove
the polynomial complexity of a particular version of the Gibbs cloner for counting. We finally present efficient numerical
results with the Gibbs cloner and the combined version, while solving quite general integer and combinatorial optimization
problems as well as counting ones, like SAT. 相似文献
7.
一种无约束全局优化的水平值下降算法 总被引:1,自引:0,他引:1
本文研究无约束全局优化问题,建立了一种新的水平值下降算法(Level-value Descent Method,LDM).讨论并建立了概率意义下取全局最小值的一个充分必要条件,证明了算法LDM是依概率测度收敛的.这种LDM算法是基于重点度取样(Improtance Sampling)和Markov链Monte-Carlo随机模拟实现的,并利用相对熵方法(TheCross-Entropy Method)自动更新取样密度,算例表明LDM算法具有较高的数值精度和较好的全局收敛性. 相似文献
8.
A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation* 总被引:2,自引:0,他引:2
We present a new method, called the minimum cross-entropy (MCE) method for approximating the optimal solution of NP-hard combinatorial optimization problems and rare-event probability estimation, which can be viewed as an alternative to the standard cross entropy (CE) method. The MCE method presents a generic adaptive stochastic version of Kull-backs classic MinxEnt method. We discuss its similarities and differences with the standard cross-entropy (CE) method and prove its convergence. We show numerically that MCE is a little more accurate than CE, but at the same time a little slower than CE. We also present a new method for trajectory generation for TSP and some related problems. We finally give some numerical results using MCE for rare-events probability estimation for simple static models, the maximal cut problem and the TSP, and point out some new areas of possible applications.AMS 2000 Subject Classification: 65C05, 60C05, 68W20, 90C59*This reseach was supported by the Israel Science Foundation (grant no 191-565). 相似文献
9.
A new artificial neural network solution approach is proposed to solve combinatorial optimization problems. The artificial neural network is called the Tabu Machine because it has the same structure as the Boltzmann Machine does but uses tabu search to govern its state transition mechanism. Similar to the Boltzmann Machine, the Tabu Machine consists of a set of binary state nodes connected with bidirectional arcs. Ruled by the transition mechanism, the nodes adjust their states in order to search for a global minimum energy state. Two combinatorial optimization problems, the maximum cut problem and the independent set problem, are used as examples to conduct a computational experiment. Without using overly sophisticated tabu search techniques, the Tabu Machine outperforms the Boltzmann Machine in terms of both solution quality and computation time. 相似文献
10.
Mark Zlochin Mauro Birattari Nicolas Meuleau Marco Dorigo 《Annals of Operations Research》2004,131(1-4):373-395
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimization, stochastic gradient ascent, cross-entropy and estimation of distribution methods. We discuss similarities as well as distinctive features of each method and we propose some extensions. 相似文献