多线材一维下料问题的求解策略  

Strategies for Solving the 1D Cutting Stock Problem of Multiple Stock Lengths

作　　者：崔耀东[1] 周密[1] 杨柳[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《广西师范大学学报（自然科学版）》2012年第3期149-153,共5页Journal of Guangxi Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(61063031)

摘　　要：本文将线性规划与增强顺序法相结合,求解多线材一维下料问题。采用具有全容量特性的解法,一次生成多个排样方式,按比值法选择新排样方式。实验结果表明:对于文献中报道的一些例题,运用算法可降低线材成本;和商业一维下料CAD系统相比,在下料方案的线材成本相同的前提下,本文算法可大幅度缩短计算时间。The linear programming approach and the enhanced sequential heuristic procedure are combined to solve the 1D cutting stock problem of multiple stock lengths.A procedure of the all capacity property is used to generate multiple patterns,from which the new pattern is selected using a ratio method.The experimental result indicates that the algorithm can improve the solutions to some benchmark instances and give solutions of the same material cost as that of some commercial packages,using much shorter computation time.

关 键 词：一维下料 线材下料 排样问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TH164[自动化与计算机技术—计算机科学与技术]