%0 Journal Article
%T Applying AB classification method in one-dimensional cutting stock problem<br>一维下料问题的AB分类法
%A LIN Jian-liang
%A <br>林健良
%J 计算机应用
%D 2009
%I 
%X In order to solve large-scale one-dimensional cutting stock problem of calculating difficulties, according to the characteristics of one-dimensional cutting stock problem, the author used random search technology to improve the greedy algorithm and put forward a kind of simple and practical classification method named AB. Experiments show that the algorithm for larger problems can quickly obtain the optimal solution or approximate optimal solution with high accuracy.
%K one-dimensional cutting stock problem
%K greedy algorithm
%K optimization
%K random search<br>一维下料问题
%K 贪心算法
%K 优化
%K 随机搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=1EFB8E4C5610E13FD0831B778C7282D7&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=94C357A881DFC066&sid=7A62566A3C1FFBE1&eid=819029E276C005ED&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=5