Description: 用遗传算法解决背包问题，可以求最优解，也可以自己设定次数-using genetic algorithms to solve knapsack problem, the optimal solution can help, can set its own number Platform: |
Size: 2065408 |
Author: |
Hits:
Description: 基于遗传算法的背包问题求解，有基本的说明和代码
其他人不需帐号就可自由下载此源码 -Based on genetic algorithms for solving knapsack problem, some basic instructions and code other people without accounts can download this free source Platform: |
Size: 1024 |
Author:ZHANGWEN |
Hits:
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever, then it is better not to look at this issue. Platform: |
Size: 201728 |
Author:gouyabin |
Hits:
Description: 一种改进的萤火虫算法解决动态0-1背包问题。经过测试，算法就有良好的性能。-Firefly Algorithm (FA), Genetic Algorithm (GA) and Differential
Evolution (DE) have been widely used for static optimization problems, but the applications of those
algorithms in dynamic environments are relatively lacking. In the present study, an effective FA introducing
diversity with partial random restarts and with an adaptive move procedure is developed and proposed
for solving dynamic multidimensional knapsack problems. To the best of our knowledge this
paper constitutes the first study on the performance of FA on a dynamic combinatorial problem. In order
to uate the performance of the proposed algorithm the same problem is also modeled and solved by
GA, DE and original FA. Based on the computational results and convergence capabilities we concluded
that improved FA is a very powerful algorithm for solving the multidimensional knapsack problems
for both static and dynamic environments. Platform: |
Size: 2839552 |
Author:孙雪 |
Hits:
Search - genetic algorithms for knapsack problem