搜索资源列表
computer_classical_arithmetic
- 该文件主要为分治策略、概率算法、回溯算法、枚举法、模拟退火算法、排序算法、搜索算法、贪心算法、遗传算法、蚁群算法的介绍及实现方式-The document mainly divide and conquer, probabilistic algorithms, backtracking algorithm, enumeration method, simulated annealing algorithm, sorting algorithm, search algorithm, greedy
tuihuoyichuanfa
- 遗传模拟退火算法，是一种对遗传算法的改进，效率很好。-Annealing Genetic Method
模拟退火算法
- 主要是介绍模拟退火算法的由来，及其模型，应用方面的问题
模拟退火法解决车辆路径问题
- 模拟退火法解决车辆路径问题，用matlab编程解决的，亲测可用.
模拟退火算法解决tsp问题
- 设计一个可以对TSP问题进行组合优化的连续型Hopfield神经网络模型，利用该魔心可以快速的找到最优的一条路线。(A continuous Hopfield neural network model for combinatorial optimization of TSP problems is designed, which can be used to find the optimal route quickly.)
SimuA_pso
- 基于模拟退火的粒子群算法。适合初学者对模拟退火和粒子群的理解。(Particle swarm optimization algorithm based on simulated annealing. For beginners, the understanding of simulated annealing and particle swarm.)
SAAC++版
- 使用C++来实现模拟退火算法。适合有一定C++基础的，对模拟退火感兴趣的人。(Using C++ to achieve simulated annealing algorithm. Suitable for people with a certain C++ base, interested in simulated annealing.)
SA_TSP
- 通过模拟退火算法解决旅行商问题，具有较全的功能，改进算法可以直接加入其中(Through the simulated annealing algorithm to solve the traveling salesman problem, with full function, the improved algorithm can be directly added to them)
SA
- 使用模拟退火解旅行商问题，因为这个问题本身是一个NP难问题，所以也就求不到最优解，不过应该可以求得一个比较好的解，然后再手工优化。(Using simulated annealing to solve the traveling salesman problem, because the problem itself is a NP hard problem, so it can not find the optimal solution, but it should be able to ob
simon sample answers
- 解决旅行商问题，模拟退火算法，用PYTHON语言编写，工具是IDLE 3.6.1，应该可以正常运行(annwal SimAnneal aaaaaaaaaaaaaaaa)
GA_tuihuo1
- 模拟退火优化遗传算法，改进了遗传操作，自适应参数(improved simulated annealing and optimized genetic algorithm)
SAforTSP
- 模拟退火算法求解物流配送系统的tsp问题，使用MATLAB编写语言，简单易懂，适合初学者学习。(Simulated annealing algorithm for solving logistics and distribution systems TSP problem, using MATLAB programming language, easy to understand, suitable for beginners to learn.)
SA
- 该算法是模拟退火中最经典的一个算法，解决最短路的问题。运行过完全没有任何bug，代码中给了相关的数据，如果想用的话，只需要把你需要的数据放进去直接运行就可以出结果(The algorithm is the most classic algorithm in simulated annealing to solve the shortest path problem. Run completely without any bug, the code to the relevant data, if
模拟退火
- 利用模拟退火算法 计算城市最短距离 无闭合回路tsp商旅问题求解(monituihou jiejeuchengshi zuiduanlujingwenti)
monituihuo
- 利用模拟退火算法计算f(x)=xcos(5*pi*x)+3.5在区间【-1，2.5】上的最小值(The minimum value of F (x) =xcos (5*pi*x) +3.5 in the interval [-1, 2.5] is calculated by using simulated annealing algorithm)
模拟退火算法
- 此种算法简单，有效，可以对所求的数据更加优化，使所求数据更加合理，绝对可以运行，请大家放心。(This algorithm is simple and effective. It can be more optimized for the data requested, so that the data is more reasonable and can be run. Please be assured.)
模拟退火
- 此代码用于求解二维数据中的优化问题，效果挺好的，文件里有二维数据的问题，大家可以好好看看！(This code is used to solve optimization problems in 2d data. The results are good. There are two dimensional data problems in the file, so you can have a good look!)
模拟退火禁忌搜索遗传算法神经网络MATLAB程序合集
- 模拟退火，禁忌搜索，遗传算法，神经网络-MATLAB程序合集(Simulated annealing, tabu search, genetic algorithms, neural networks - MATLAB collection)
Untitled5
- 给定城市坐标，通过模拟退火求解TSP问题(Given the city coordinates, solve the TSP problem by simulated annealing)
Untitled6
- 随机生成坐标，利用模拟退火求解TSP问题(Randomly generate coordinates, using simulated annealing to solve TSP problem)