搜索资源列表
aa
- 遗传算法 遗传算法简称GA(Genetic Algorithm)，在本质上是一种不依赖具体问题的直接搜索方法。遗传算法在模式识别、神经网络、图像处理、机器学习、工业优化控制、自适应控制、生物科学、社会科学等方面都得到应用。在人工智能研究中，现在人们认为“遗传算法、自适应系统、细胞自动机、混沌理论与人工智能一样，都是对今后十年的计算技术有重大影响的关键技术”。-Referred to as genetic algorithm genetic algorithm GA (Genetic Algo
backpack-ga-algorithm
- 背包问题或0-1背包问题遗传算法程序，里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.
GA
- 热力学遗传算"~-(therm odynamical genetic algorithms，简称TDGA)借鉴固体退火过程中能量与熵的竞争 模式来协调GA 中“选择压力”和“种群多样性”之间的冲突．然而TDGA 目前极高的计算代价限制了其应用．为了提 高TDGA的计算效率，首先定义一种等级熵(rating—based entropy,J~j称RE)度量方法，它能以较小的计算成本度量种 群中个体适应值的分散程度．然后引入分量热力学替换规则(component thermod)rnami
GA
- 遗传算法 0-1背包问题的代码 初始群体 选择 交叉 变异 评估函-0-1 knapsack problem genetic algorithm code for the initial assessment of functional group selection crossover and mutation
knapsack-ga
- knapsack genet algorithm
C.GA
- 遗传算法解决组合优化问题，0-1背包问题-Genetic algorithm to solve combinatorial optimization problems, 0-1 knapsack problem
Knapsack-problem-with-GA
- solving knapsack 0,1 problem with GA in matlab
ga
- 遗传算法求解背包问题，结果不错，可以借鉴-Genetic algorithm to solve the knapsack problem, the results are good, can learn
Knapsack-problem-based-on-GA
- 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper
GA-to-solve-knapsack-problem
- Genetic algorithm to solve knapsack problem
Algoritma-GA-(Knapsack)
- MatLab code Genetic Algorithm for Knapsack Problem
FA2
- 一种改进的萤火虫算法解决动态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 rela
QGA-AND-GA-for-knapsack
- 本源程序里面实现了基本的遗传算法与量子遗传算法实现0-1背包问题，并对实现结果截图并分析了。-The source of which the realization of the genetic algorithm and the quantum genetic algorithm to achieve the basic 0-1 knapsack problem, and the results were analyzed.
GA-knapsack-problem
- 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming.
GA
- python遗传算法求解背包问题,后者由1978年由Merkel和Hellman提出。其运行依赖DEAP -python genetic algorithm knapsack problem, which in 1978 proposed by Merkel and Hellman. Its operation depend DEAP
GA
- matlab代码遗传算法解决背包问题，0-1整数规划问题-Genetic algorithm to solve knapsack problem, 01 integer programming problem
GA_solveKnapsack-problem
- 利用基本遗传算法解决组合优化问题——背包问题-solving Knapsack problem based on GA
GA-knapsack
- genetic algoritm - knapsack
Binary-Knapsack-Problem
- ga knapsack problem genetic algorythm