文件名称:n个圆的组合
- 所属分类:
- 其它
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2008-10-13
- 文件大小:
- 858.67kb
- 下载次数:
- 0次
- 提 供 者:
- 周**
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
对工作分配进行多次优化,直到找到最优的分配方式。 首先将所有工作交给能力最强的人做,然后找出最低安全值和最高安全值,此时将未分配工作的人的能力值当作安全值参与判断,把安全值最低者分配的仓库数减一,并将这个仓库交给安全值最高者看守,然后进入下次优化,在新一次优化过程中把最低安全值和上次优化时的最低安全值作比较,如果这次最低安全值比上次大,则继续进行优化,若系统最低安全值相比上次下降,则说明上次优化后的结果已经是最优,即得结果。-work on a number of distribution optimization, until they found the optimal method of distribution. First of all to the most capable people to do and then find the minimum value and maximum security safety value has been assigned to this work of the human capacity as a safety value in judging the value safety, the lowest value of the distribution by a few warehouses and storage to the value of the highest security guards, and then proceed to the next optimization of the new optimization process a minimum safe value and optimization of the last minimum safety value for comparison, if the value of the last minimum security, will continue to optimize, if the minimum safety systems compared to the previous decline in value, a statement last optimize the result is optimal, that is the findings.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 984597n个圆的组合.rar 列表 Debug\A.exe Debug\A.ilk Debug\A.obj Debug\A.pch Debug\A.pdb Debug\vc60.idb Debug\vc60.pdb Debug A.CPP A.DSP A.DSW A.ncb A.OPT A.PLG