Simulated Annealing for Graph Bisection
a result of Bui 5] to the e ect that hillclimbing (randomized greedy, or the Metropolis algorithm at temperature 0) is ine ective for very sparse graphs, and cannot even discover 1 the obvious minimum bisection existing between a pair of 2 n-vertex random cubic graphs. Bui also conjectured that simulated annealing, and maybe even hillclimbing, would be e ective for dense random graphs, and this is now seen to be correct, at least for simulated annealing. The performance of hillclimbing on dense random graphs remains unanalyzed.
2 Annealing Model and Key Notation An annealing algorithm is begun in a random state. Moves are generated or proposed at random, and may be accepted (in which case the current state is updated) or rejected (in which case the state is left unchanged). A move which would increase the cost by a (positive or negative) quantity cost is accepted with probability A( cost). We consider the most obvious application of annealing to the graph bisection problem, in which a state is a bisection of G into sets L and R, the cost (or\energy") cost(L; R) of a state (L; R) is its cut-width, and a move is the exchange of a vertex in L with a vertex in R. We take as the acceptance function 1 exp(? cost=T ) A( cost)= 1+ exp(? cost=T )= 1+ exp( cost=T ); where T is the temperature parameter for the annealing. This acceptance function is common, albeit not as common as A( cost)= minf1; exp(? cost=T )g whose nonuniformity complicates the analysis. Both acceptance rules de ne an ergodic Markov chain on bisections, and both share the stationary distribution in which the probability of (L; R) is proportional to exp(? cost(L; R)=T ). (The stationary distribution gives the limiting probability of being at state (L; R) as time t ! 1.) So that the graph can be bisected exactly, it is natural to restrict the number of vertices to be even. In fact, we shall further restrict it to be a multiple of 4, so that henceforth we consider random graphs drawn from G4n;p;r . This restriction is immaterial to the results but conveniently makes the imbalance{ a key quantity in our analysis{ an integral value, The imbalance of any partitioning of G 2 G4n;p;r is the value k 0 for which there are n? k white vertices in one partition (which without loss of generality we call partition L) and n+ k in the other (partition R). (L and R are labeled arbitrarily for k= 0.) A given annealing move will either leave k unchanged, or will increase or decrease it by 1. 4
2.1 Annealing algorithm
2.2 Graph model and parameterization
Simulated Annealing_工学_高等教育_教育专区。Simulated AnnealingSimulated Annealing (模拟退火法)报告人:陈世明 Simulated Annealing 1 大纲 简介 攀登演算法 模拟...
Novel Adaptive Simulated Annealing Algorithm for Constrained Multi-Objective Optimization_专业资料。/专h rii j ioncnf CamuasnntCoNovel AdapiSiuledAnnealgtve mat ...
4.Simulated Annealing_计算机软件及应用_IT/计算机_专业资料。模拟退火算法Practical Optimization Algorithm Design Lesson 4: Simulated Annealing Thomas Weise Nature...
Parallel Genetic Simulated Annealing Hybrid Algorithm for Task Scheduling 隐藏>> 维普资讯 http://www.cqvip.com VoI1 No. 20 17—32. 15063818 Naur ...
A hybrid genetic-simulated annealing algorithm for optimization of hydraulic manifold blocks_专业资料。维普资讯 http://www.cqvip.com A Jhnh nEgE)20,23:6...
Genetic simulated annealing algorithm for task scheduling based on cloud computing environment_天文/地理_自然科学_专业资料。Genetic Simulated Annealing Algorithm...
Optimization by simulated annealing: A necessary and su cient condition for convergence. In Van Ryzin, J., editor, Adaptive Statistical Procedures and ...
To address the problem of the self-optimization of coverage and capacity in LTE networks, we introduce an approach based on a simulated annealing algorithm...
Leighton, \Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms," in Proc. ACM/IEEE Design Automation Conf., ...
4] T. N. Bui, \Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms", in Proc. ACM/IEEE Design Automation...
热门文档