文件名称:main
介绍说明－－下载内容均来自于网络，请自行研究使用
采用多目标粒子群算法求解多目标背包问题 问题：假设存在五类物品，每类物品又包含四种具体物品，要求从五类物品中分别选择一种放入背包，使得背包总价值最大，总体积最小，总质量不超过92kg(The problem is solved by multi objective particle swarm optimization algorithm, multi-objective knapsack problem: suppose there are five categories of goods, items in each category contains four specific items from five items were selected into a backpack, making the total value of the maximum minimum total volume, backpack, total quality does not exceed 92kg)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| main.m | 6048 | 2010-12-28 |