- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
SimulatedAnnealing(AInotes)-SchoolofComputerScience.doc
Simulated Annealing
1. What is Simulated Annealing?
Simulated Annealing (SA) is motivated by an analogy to annealing in solids. The idea of SA comes from a paper published by Metropolis etc al in 1953 [Metropolis, 1953). The algorithm in this paper simulated the cooling of material in a heat bath. This is a process known as annealing.
If you heat a solid past melting point and then cool it, the structural properties of the solid depend on the rate of cooling. If the liquid is cooled slowly enough, large crystals will be formed. However, if the liquid is cooled quickly (quenched) the crystals will contain imperfections.
Metropolis’s algorithm simulated the material as a system of particles. The algorithm simulates the cooling process by gradually lowering the temperature of the system until it converges to a steady, frozen state.
In 1982, Kirkpatrick et al (Kirkpatrick, 1983) took the idea of the Metropolis algorithm and applied it to optimisation problems. The idea is to use simulated annealing to search for feasible solutions and converge to an optimal solution.
Simulated annealing is described in many textbooks. If you want an easy to follow description, I would recommend (Dowsland, 1995). Not only is the description good, but it contains many references for the interested student. Much of this text is based on (Dowsland, 1995).
2. Simulated Annealing versus Hill Climbing
As we have seen in previous lectures, hill climbing suffers from problems in getting stuck at local minima (or maxima). We could try to overcome these problems by trying various techniques.
We could try a hill climbing algorithm using different starting points.
We could increase the size of the neighbourhood so that we consider more of the search space at each move. For example, we could try 3-opt, rather than a 2-opt move when implementing the TSP.
Unfortunately, neither of these have proved satisfactory in practice when using a simple hill climbing algorithm.
Simulated annealing solves this pr
您可能关注的文档
- SectionComm'nsSummaryRegionSDC-IEEERegion6.ppt
- securityawarenessandacceptableusepolicy-TrustKeeper.doc
- Sedimentstrengthanddeformationaffectedbyopal.ppt
- SeismicConsiderations-Transformercomponents.ppt
- SeismicWavePropagation.ppt
- SELECTEDHEATTREATINGTERMSHEATTREATMENT.PDF
- SelectingtheBestCarburizingMethodfortheHeat.PDF
- Selectiveandlocalizedlaser-annealeffectforhigh.PDF
- SelectorChartAdditive.ppt-ElementisSpecialties.ppt
- Self-AwarenessandSelf-Love.ppt
- SimulatedAnnealingSolutiontotheKnapsackProblem.PDF
- simulatingheattreatmentprocesses-ASMInternational.PDF
- SimulationInterestGroupScenarioTemplate-EMEDU.org.doc
- simulationofoslpulse-annealingatdifferentheatingrates.PDF
- SimulationofOxygenPenetrationandDecarburisationin.PDF
- SingleCrystalSlip.ppt
- SingleParticleandCollectiveModesinNuclei.ppt
- SinglePrecisionReciprocalbyMultipartiteTableLook-up.PDF
- Singularperturbationsforanelasticmodeloftheheart.ppt
- SiouxFallsArgusLeader,SD.doc
原创力文档


文档评论(0)