作业帮英语翻译摘要:模拟退火算法(simulated annealing,简称SA)是基于Mente Carlo的迭代求解策略的一种随机寻优算法,其来源于固体退火原理.将固体加温至充分高,再让其徐徐冷却,加温时,固体内部粒子随
来源：学生作业帮助网 编辑：作业帮 时间：2024/05/12 05:12:04
英语翻译摘要:模拟退火算法(simulated annealing,简称SA)是基于Mente Carlo的迭代求解策略的一种随机寻优算法,其来源于固体退火原理.将固体加温至充分高,再让其徐徐冷却,加温时,固体内部粒子随
英语翻译
摘要:模拟退火算法(simulated annealing,简称SA)是基于Mente Carlo的迭代求解策略的一种随机寻优算法,其来源于固体退火原理.将固体加温至充分高,再让其徐徐冷却,加温时,固体内部粒子随温升变为无序状,内能增大,而徐徐冷却时粒子渐趋有序,在每个温度都达到平衡态,最后在常温时达到基态,内能减为最小.本文着重分析模拟退火算法的实现过程,以及叙述如何利用模拟退火解决具有NP难度的装填问题—不等圆Packing问题.
关键字:模拟退火算法; NP难度; 装填问题;不等圆Packing问题
英语翻译摘要:模拟退火算法(simulated annealing,简称SA)是基于Mente Carlo的迭代求解策略的一种随机寻优算法,其来源于固体退火原理.将固体加温至充分高,再让其徐徐冷却,加温时,固体内部粒子随
楼上的筒子,google翻的?很不通顺啊,楼主你这篇论文太专业,翻得很费劲,要加分哦
Abstract:A simulated annealing(SA for short) is based on the Mente Carlo iterative strategy which is a stochastic optimization algorithm.It's derived from the solid-annealing principle.It refers to heating the solid material at enough high temperature,then let it cool slowly.The inner particles becomes disordered shape when heated,and the inner energy increase.Afterward the particles gradually resume orderly.And it reach equilibriumat at each temperature,finally reach the ground state at normal temperature,meanwhile the inner energy reduce to minimum.This paper aims at simulating annealing process and describes how to use simulated annealing to solve the NP filling issue - unround packing.
Keywords:simulated annealing algorithm; NP difficulty; filling issue; unround packing issue
Abstract: A simulated annealing algorithm (simulated annealing, referred to as SA) is based on the iterative solution Mente Carlo strategy for a stochastic optimization algorithm, which derived from t...
全部展开
Abstract: A simulated annealing algorithm (simulated annealing, referred to as SA) is based on the iterative solution Mente Carlo strategy for a stochastic optimization algorithm, which derived from the principles of solid-annealing. Heating the solid to fully high, let the slowly cooling, heating, the solid particles with the internal temperature becomes disordered shape, which can be increased, while the slowly cooling particles gradually and orderly, at each temperature are to reach equilibrium, finally reached the ground state at room temperature, which can be reduced to the minimum. This paper aims at the realization of simulated annealing process and describes how to use simulated annealing to solve the difficulty with the filling of NP problems - ranging from a round Packing problem.
Keywords: simulated annealing algorithm; NP difficulty; filling issues; ranging from a round Packing problem
收起
Abstract: simulated annealing algorithm (simulated annealing, referred to as SA) is based on the Mente Carlo iteration strategy of a random optimization algorithm, which originates from solid annealin...
全部展开
Abstract: simulated annealing algorithm (simulated annealing, referred to as SA) is based on the Mente Carlo iteration strategy of a random optimization algorithm, which originates from solid annealing principle. High heat until fully will be solid, then let it slowly, heating, cooling and solid particles with internal temperature into disorder, can increase, and gradually cooled particles in each temperature gradually orderly, and finally reaches equilibrium is reached in normal ground when reduced to the minimum, internal. This paper analyzed and simulated annealing algorithm, and the realization process of using simulated annealing describes how to solve the problem with a np-hard loading range Packing problem -- round.
Key words: the simulated annealing algorithm, A np-hard, Loading problem, Packing problems ranging from round
收起