搜索资源列表
yingyongGAjiejue0-1beibaowenti
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm combined to form hybrid genetic algorithm, and solve the classic knapsack problem.
TSP
- 用遗传算法、贪心算法以及穷举法对TSP问题进行求解-Genetic algorithm, the greedy algorithm and the brute-force method to solve the TSP problem
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
1
- 利用dijkstra贪心法获取由结点1到其余结点最短路径长度，输出保存到外部文件中-Get the rest node 1 to node shortest path length, save the output to an external file dijkstra-output1.txt use dijkstra greedy method
Matlab十大算法源代码
- Floyd算法，概率算法，类比法，蒙特卡洛，神经网络，贪婪算法，模拟退火算法，灰色预测，遗传算法等(Floyd algorithm, probability algorithm, analogy method, Monte Carlo, neural network, greedy algorithm, simulated annealing algorithm, grey prediction, genetic algorithm, etc.)