饲料厂料仓设计的研究

目前，国内饲料厂料仓设计存在着计算仓容所用依据不可靠、料仓结构有待优化、辅助设施尚未真正配套等实际问题。已严重影响到饲料厂的正常生产。笔从更新传统设计观念出发，借鉴国内外成功经验，以料仓仓容确定、料仓结构选择为突破口，辅之以辅助设施的有效配套与料仓的合理布置，较好地解决了饲料厂料仓设计中的实际问题，具有较强的实际推广价值。     

EXACT ALGORITHM FOR BIN COVERING

ＩＮＴＲＯＤＵＣＴＩＯＮＴｈｅｂｉｎｃｏｖｅｒｉｎｇｐｒｏｂｌｅｍｃａｎｂｅｓｔａｔｅｄａｓｆｏｌｌｏｗｓ.Ｇｉｖｅｎｎｉｔｅｍｓｏｆｗｅｉｇｈｔｓｌ1 … ,ｌｎ ａｎｄａｎｕｎｌｉｍｉｔｅｄｎｕｍｂｅｒｏｆｉｄｅｎｔｉｃａｌｂｉｎｓｏｆｃａｐａｃｉｔｙＣ ,ｐａｃｋｔｈｅｉｔｅｍｓｉｎａｓｍａｎｙｂｉｎｓａｓｐｏｓｓｉｂｌｅｓｏｔｈａｔｔｈｅｔｏｔａｌｗｅｉｇｈｔｏｆｅａｃｈｂｉｎｉｓｎｏｌｅｓｓｔｈａｎｉｔｓｃａｐａｃｉｔｙ.Ｔｈｅｂｉｎｃｏｖｅｒｉｎｇｐｒｏｂｌｅｍｗａｓｆｉｒｓｔｓｔｕｄｉｅｄ…     

条形装箱问题的基于后缀表达式的混合遗传算法

装箱问题作为一种常见的运筹问题,在很多领域有着重要的应用,装箱问题可以分为一维、二维和三维装箱.主要讨论了二维装箱中条形装箱问题的遗传算法的求解,其中采用后缀表达式的形式对装箱方案进行编码,并详细提出了解码的算法和有关的证明,最后通过实例证明了该算法是可行的.     

Bounded space algorithms for variant of variable-sized bin packing

Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.     

A novel blind deconvolution algorithm using single frequency bin

Former frequency-domain blind devolution algorithms need to consider a large number of frequency bins and recover the sources in different orders and with different amplitudes in each frequency bin,so they suffer from permutation and amplitude indeterminacy troubles. Based on sliding discrete Fourier transform,the presented deconvolution algorithm can directly recover time-domain sources from frequency-domain convolutive model using single frequency bin. It only needs to execute blind sepa-ration of instantaneous mixture once there are no permutation and amplitude indeterminacy troubles. Compared with former algorithms,the algorithm greatly reduces the computation cost as only one frequency bin is considered. Its good and robust per-formance is demonstrated by simulations when the signal-to-noise-ratio is high.