Introduction - If you have any usage issues, please Google them yourself
Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root radius of timber ri. Asked how the packing, making maximum utilization of container space? This procedure requires greedy algorithm solution: greedy algorithm is always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, it made sense only in a local optimal solution.
Packet : 35738641jzxcalc.rar filelist
cover1.jpg
cover.jpg
errs.txt
Form1.frm
Form1.frx
Form3.frm
Form3.frx
Form4.frm
Form4.frx
Form5.frm
goods.txt
Module1.bas
MSSCCPRJ.SCC
temps.txt
trays.txt
大工作面剩余空间编号示意.JPG
工程1.PDM
工程1.vbp
工程1.vbw
小工作面剩余空间编号示意.JPG
使用说明.txt
枕善居VB.NET源码博客.url
枕善居VB源码博客.url
给 枕善居 发邮件.url
containers.txt