搜索资源列表
TSPTravelingsalesmanproblem
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0－1背包问题MATLAB源代码 -complete graph Hamilton Circle genetic simulated annealing Matlab to be definitive source solution annealing 0 - a knapsack problem MATLAB source code
saa
- 使用模拟退火算法解0－1背包问题MATLAB源代码-using simulated annealing Xie 0-1 knapsack problem MATLAB source code
sa_01.zip
- 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。,This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
xujinpeng-matlab.rar
- 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
蚁群算法
- 蚁群算法/ 蚁群算法/Matlab中文论坛--助努力的人完成毕业设计.url 蚁群算法/一种快速求解旅行商问题的蚁群算法.pdf 蚁群算法/使用帮助：新手必看.htm 蚁群算法/基于改进蚁群算法对最短路径问题的分析与仿真.pdf 蚁群算法/基于改进蚁群算法的出租车路径规划算法.pdf 蚁群算法/基于改进蚁群算法的最短路径问题研究.pdf 蚁群算法/基于蚁群算法的公交路线走向模型及其求解.pdf 蚁群算法/基于蚁群算法的完全遍历路径规划研究.PDF 蚁群算法/用蚂蚁算法和模拟退火
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
an
- 利用模拟退火解决0-1背包问题，适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
0-1-knapsack-problem
- 模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
KnapsackProblem
- 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about fr
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
NP-hard-problem
- matlab模拟退火算法，处理背包问题，相比较与遗传算法模拟退火原理简单，编译容易-matlab simulated annealing algorithm to handle the knapsack problem, compared with the genetic simulated annealing algorithm is simple, easy to compile
0-1knapsack-problem
- 这是一个简单的0-1背包问题，采用matlab编程，使用模拟退火算法求解，结果精确快速，并可以应用到很多其他问题-This is a simple 0-1 knapsack problem, using matlab programming, simulated annealing algorithm, accurate results quickly, and can be applied to many other problems
simulated annealing algorithm
- 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
RCJBR
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0－1背包问题MATLAB源代码()
iikdmxk1
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0－1背包问题MATLAB源代码()
模拟退火算法
- 模拟退火算法解决背包问题，matlab环境实现c流程(Simulated annealing algorithm solves knapsack problem, and realizes C process in Matlab environment.)