Location:
Search - 模拟退火优化算法
Search list
Description: 模拟退火优化算法 Simulated annealing is a simple and general algorithm for finding global minima. It operates by simulating the cooling of a (usually fictitious) physical system whose possible energies correspond to the values of the objective function being minimized. The anal- ogy works because physical systems occupy only the states with the lowest energy as the temperature is lowered to absolute zero. Simulated annealing has been developed by a wide and highly interdisciplinary com- munity and used by an even wider one. As a consequence, its techniques and results are scattered through the literature and are not easily accessible for the computer scientist, physicist, or chemist who wants to become familiar with the field. The present monograph is intended both as an introduction for the noninitiated and as a review for the more expert reader. We start by developing the subject from scratch. We then explain the methods and techniques indispensable for building state-of-the-art implementations. The physical background presented is meant to sharpen the reader's intuition for the field.
Platform: |
Size: 6738858 |
Author: luli395 |
Hits:
Description: 模拟退火算法在贷款组合优化决策中的应用-simulated annealing algorithm in the loan portfolio optimization of
Platform: |
Size: 18432 |
Author: 张科 |
Hits:
Description: 遗传算法和模拟退火算法相结合的并行实现-genetic algorithms and simulated annealing algorithm combining the parallel implementation
Platform: |
Size: 11264 |
Author: 刘雨 |
Hits:
Description: 模拟退火c++的算法程序，广泛应用于最优化、运筹学、人工智能、遗传算法等领域，具有很好的学习价值-simulated annealing algorithm procedures, the most widely used optimization, operations research, artificial intelligence, genetic algorithms and other areas of learning is very good value
Platform: |
Size: 43008 |
Author: hu |
Hits:
Description: 模拟退火算法是为了避免求解最优化出现局部极值的问题而提出的算法，保证最终的结果是全局最优的，该matlab源程序能在matlab环境中实现-simulated annealing method is the best solution in order to avoid a partial optimization of extreme concern raised by the algorithm to ensure that the final result is that the global optimum, the source Matlab can achieve Matlab environment
Platform: |
Size: 5120 |
Author: yj |
Hits:
Description: 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解，这是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。退火过程由冷却进度表(Cooling Schedule)控制，包括控制参数的初值t及其衰减因子Δt、每个t值时的迭代次数L和停止条件S。
-simulated annealing algorithm derived from solid annealing method, the heating to the full solid, let its slowly cooling, heating, solid particles with internal temperature rise-into disorder, which can increase, and slowly cooling gradual and orderly particles in each temperature has reached equilibrium, in the end when the temperature reached to ground state, which can be reduced to the minimum. According to the Metropolis criteria particles at a temperature T leveling the probability of e- E/(kT), in which the E-T when the temperature within, E capacity for change, for the Boltzmann constant k. Solid simulated annealing combinatorial optimization problems, will be able to target E simulation function f, T evolved temperature control parameters t, that is to be solving combinatorial o
Platform: |
Size: 9216 |
Author: 刘明 |
Hits:
Description: 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解，这是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。退火过程由冷却进度表(Cooling Schedule)控制，包括控制参数的初值t及其衰减因子Δt、每个t值时的迭代次数L和停止条件S。
-simulated annealing algorithm derived from solid annealing method, the heating to the full solid, let its slowly cooling, heating, solid particles with internal temperature rise-into disorder, which can increase, and slowly cooling gradual and orderly particles in each temperature has reached equilibrium, in the end when the temperature reached to ground state, which can be reduced to the minimum. According to the Metropolis criteria particles at a temperature T leveling the probability of e- E/(kT), in which the E-T when the temperature within, E capacity for change, for the Boltzmann constant k. Solid simulated annealing combinatorial optimization problems, will be able to target E simulation function f, T evolved temperature control parameters t, that is to be solving combinatorial o
Platform: |
Size: 11264 |
Author: 刘明 |
Hits:
Description: 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解，这是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。退火过程由冷却进度表(Cooling Schedule)控制，包括控制参数的初值t及其衰减因子Δt、每个t值时的迭代次数L和停止条件S。
-simulated annealing algorithm derived from solid annealing method, the heating to the full solid, let its slowly cooling, heating, solid particles with internal temperature rise-into disorder, which can increase, and slowly cooling gradual and orderly particles in each temperature has reached equilibrium, in the end when the temperature reached to ground state, which can be reduced to the minimum. According to the Metropolis criteria particles at a temperature T leveling the probability of e- E/(kT), in which the E-T when the temperature within, E capacity for change, for the Boltzmann constant k. Solid simulated annealing combinatorial optimization problems, will be able to target E simulation function f, T evolved temperature control parameters t, that is to be solving combinatorial o
Platform: |
Size: 6144 |
Author: 刘明 |
Hits:
Description: 这是关于模拟退火算法的资料，对于研究优化算法的同志有一定的参考价值。-This is a simulated annealing algorithm on the data, the study of optimization algorithm comrades have certain reference value.
Platform: |
Size: 142336 |
Author: |
Hits:
Description: 通用模拟退火优化算法
General simulated annealing algorithm 模拟退火优化算法能过较大限度的避免局部最优解
-General simulated annealing optimization algorithm General simulated annealing algorithm simulated annealing optimization algorithm can have a greater level of local optimal solution to avoid
Platform: |
Size: 1024 |
Author: okboy |
Hits:
Description: 一系列好用的用户友好的启发式优化算法，包括非自适应算法，基于模拟退火算法的种群算法，基本遗传算法，差分进化算法以及粒子群优化算法。此外，也包括神圣算法，它利用了所有这些优化算子，虽然有时交换种群之间的不同算法。-A nice set of user-friendly heuristic optimizers. Included are a non-adaptive, population based Simulated Annealing algorithm, a basic Genetic Algorithm, (transversal) Differential Evolution algorithm and Particle Swarm Optimization algorithm. Also, the GODLIKE-algorithm is included, which simply uses all of these optimizers while occasionally swapping populations between the different algorithms.
Platform: |
Size: 26624 |
Author: 竹子的信仰 |
Hits:
Description: 用模拟退火优化遗传算法，使遗传算法具有反向搜索能力，通过仿真表明能够得到更优的值。-Optimization by simulated annealing genetic algorithm, genetic algorithm so that the reverse search capabilities, through the simulation shows that can be better value.
Platform: |
Size: 12288 |
Author: 史峰 |
Hits:
Description: 基于混沌粒子群与模拟退火优化算法的最小二乘支持向量机参数自选择方法-Based on Chaotic Particle Swarm Optimization and Simulated Annealing least squares support vector machine parameter self-selection method
Platform: |
Size: 344064 |
Author: yinjj |
Hits:
Description: 基于粒子群与模拟退火优化算法的最小二乘支持向量机参数自选择方法预测混沌序列-anessayaboutchaospredictionbyPSOLSSVM
Platform: |
Size: 281600 |
Author: 张彦 |
Hits:
Description: 使用模拟退火算法的特性解决TSP问题，另外可以利用此算法优化其他算法。(Use the simulated annealing algorithm to solve the TSP problem, and you can use this algorithm to optimize other algorithms.)
Platform: |
Size: 5469184 |
Author: adolf123
|
Hits:
Description: 模拟退火优化遗传算法，改进了遗传操作，自适应参数(improved simulated annealing and optimized genetic algorithm)
Platform: |
Size: 1024 |
Author: 均哥
|
Hits:
Description: 模拟退火算法属于现代优化算法的一种，，实现NP-hard组优化问题的全局最优解，解决大量的实际问题(The simulated annealing algorithm is one of the modern optimization algorithms, which can solve the global optimal solution of the NP-hard group optimization problem and solve a lot of practical problems)
Platform: |
Size: 2048 |
Author: Berlin0724
|
Hits:
Description: 利用模拟退火算法求解已知函数的最小值，即模拟退火算法寻优问题，可以广泛推广。(Using simulated annealing algorithm to solve the minimum of the known function, that is, the simulated annealing algorithm optimization problem, can be widely promoted.)
Platform: |
Size: 44032 |
Author: mumucq
|
Hits:
Description: 直接实现matlab的模拟退火算法优化，亲测可用，修改参数即可(Matlab simulation annealing algorithm optimization)
Platform: |
Size: 1024 |
Author: IDEALMAN
|
Hits:
Description: 优化算法有很多，经典算法包括：有线性规划，动态规划等；改进型局部搜索算法包括爬山法，最速下降法等，模拟退火、遗传算法以及禁忌搜索称作指导性搜索法。而神经网络，混沌搜索则属于系统动态演化方法。
梯度为基础的传统优化算法具有较高的计算效率、较强的可靠性、比较成熟等优点，是一类最重要的、应用最广泛的优化算法。但是，传统的最优化方法在应用于复杂、困难的优化问题时有较大的局限性。(There are many optimization algorithms, the classical algorithms include linear programming, dynamic programming, etc. the improved local search algorithms include hill-climbing method, steepest descent method, etc. simulated annealing, genetic algorithm and tabu search are called the guiding search methods. The neural network and chaotic search belong to the dynamic evolution method of the system.
Gradient based traditional optimization algorithm has the advantages of high computational efficiency, strong reliability and relatively mature. It is one of the most important and most widely used optimization algorithms. However, the traditional optimization method has great limitations when it is applied to complex and difficult optimization problems.)
Platform: |
Size: 1857536 |
Author: 韬文
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
15
»