Simulated Annealing for Graph Bisection
Simulated Annealing for Graph Bisection Mark Jerrum Gregory Sorkin y April 16, 1993
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random graph in Gnpr when p? r= (n?2 ) for 2. (The random graph model Gnpr speci es a\planted" bisection of density r, separating two n=2vertex subsets of slightly higher density p.) We show that simulated\annealing" at an appropriate xed temperature (i.e., the Metropolis algorithm) nds the unique smallest bisection in O(n2+" ) steps with very high probability, provided> 11=6. (By using a slightly modi ed neighborhood structure, the number of steps can be reduced to O(n1+" ).) We leave open the question of whether annealing is e ective for in the range 3=2< 11=6, whose lower limit represents the threshold at which the planted bisection becomes lost amongst other random small bisections. It remains open whether hillclimbing (i.e., annealing at temperature 0) solves the same problem.
Abstract
1 Introduction Simulated annealing 15] is a popular heuristic technique for approximately solving hard problems in combinatorial optimization. The method works by simulating a stochastic process on the space of feasible solutions, in which transitions between states are governed by a rule that favors states with lower cost or\energy". A parameter known as\temperature" controls the extent to which lower energy states are favored: at low temperature equilibrium, low energy states occur with much higher probability than high energy ones, while at high temperatures the di erence is less marked. To this extent, a low temperature is bene cial; however there is a tension between this e ect and a detrimental one, Department of Computer Science, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, UK. The work described here was supported by grant GR/F 90363 of the UK Science and Engineering Research Council and by Esprit Working Group\RAND", and was partly done while the author was visiting the NEC Research Institute at Princeton NJ, USA. y IBM Thomas J. Watson Research Center, J2-C27 Hawthorne, PO Box 704, Yorktown Heights, NY 10598, USA. This work was partly done while the author was visiting the University of Edinburgh under the above SERC grant.
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...
热门文档