Description: 用遗传算法解决背包问题，可以求最优解，也可以自己设定次数-using genetic algorithms to solve knapsack problem, the optimal solution can help, can set its own number Platform: |
Size: 2065408 |
Author: |
Hits:
Description: 一个求解背包问题的遗传算法，该程序是基于VB平台开发的-a knapsack problem solving genetic algorithm, the program is based on the platform in the VB Platform: |
Size: 24576 |
Author:史剑 |
Hits:
Description: 该文件包共有5个文件
TSP--传统算法---说明TSP的传统算法实践
背包问题----0-1背包问题的传统算法实践
模拟退火算法----模拟退火算法实现TSP问题
我的通讯录----我整理写的个人通讯录
遗传算法----遗传算法解决TSP问题
-The package total of five documents TSP- traditional algorithms--- algorithms that TSP practice traditional knapsack problem---- 0-1 knapsack problem of the traditional practice of simulated annealing algorithm algorithm simulated annealing algorithm---- TSP I---- I am finishing the Address Book Personal Address Book written---- genetic algorithm genetic algorithm to solve TSP problems Platform: |
Size: 10829824 |
Author:lisanshi2006 |
Hits:
Description: 用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择.
背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W·2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers. Platform: |
Size: 25600 |
Author:王杰 |
Hits:
Description: 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0/1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here. Platform: |
Size: 2048 |
Author:李博宁 |
Hits:
Description: 01背包问题的C++源程序，写的比较简单-01 knapsack problem C++ Source code, written in relatively simple Platform: |
Size: 49152 |
Author:sandy chen |
Hits:
Description: 背包算法中用遗传算法解决VB代码
希望能帮助有用得着的朋友-Knapsack algorithm using genetic algorithm to solve VB code to help a friend has useful Platform: |
Size: 1024 |
Author:adsd |
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: 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm to solve the 01 knapsack problem. In the 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. From the n-items, select the items into the backpack, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight can not exceed the capacity of backpack, the best load is the value of the items loaded the highest. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Search - genetic knapsack