中国机械工程Issue(16)：2191-2195,2203,6.DOI:10.3969/j.issn.1004-132X.2014.16.011
基于混合顺序启发式算法的一维下料问题
A Hybrid Sequential Heuristic Procedure to One-dimensional CSP
摘要
Abstract
This paper proposed an improved hybrid sequential heuristic procedure for one-dimen-sion CSP.The algorithm modified the subset selection strategy of original sequential heuristic proce-dure and avoided the ending condition in the limited time with width search algorithm,and could change the parameters according to the users’maximum time patience dynamically.Finally C# was used to realize the algorithm.the results show the algorithm is effective.This algorithm were used in Ma’anshan Steel Corp,wheel company official for more than two years,and increases the cutting rate 4%.关键词
下料问题/动态规划/顺序启发式算法/背包问题Key words
cutting stock problem (CSP)/dynamic programming/sequential heuristic procedure/knapsack problem分类
自科综合引用本文复制引用
程浩,刘心报,方昶..基于混合顺序启发式算法的一维下料问题[J].中国机械工程,2014,(16):2191-2195,2203,6.基金项目
国家自然科学基金资助重点项目(71231004) （71231004）
