基于混合顺序启发式算法的一维下料问题

A Hybrid Sequential Heuristic Procedure to One-dimensional CSP

针对一维下料问题,提出一种改进的混合顺序启发式算法。该算法修正了传统顺序启发式算法的待切子集选择策略,采用广度搜索算法在有限时间内解决终止条件问题,根据用户最大时间容忍度动态地改变参数。最后采用C#进行编程,实现了该算法,通过对比证明算法的有效性。该算法在马鞍山钢铁公司车轮分公司正式使用了两年多,使切割率提高4%。

This paper proposed an improved hybrid sequential heuristic procedure for one-dimension CSP.The algorithm modified the subset selection strategy of original sequential heuristic procedure 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 rate4%.