基于线性规划的一维优化下料系统研究与开发-机械设计及理论专业论文.docxVIP

摘要一维优化下料问题是设计领域的一个重要部分，在工程实践中有着广泛的应 摘要 一维优化下料问题是设计领域的一个重要部分，在工程实践中有着广泛的应 用，它的求解自动化理论及方法对于设计自动化领域具有典型意义。由于其本身 具有NP一完全的性质，求解具有很大的难度。为了满足诸多的限制条件，找到原材 料数量长度、零件毛坯数量长度之间的最佳对应关系，问题的解集}’分庞大．作 业研究的领域内也一直没有绝对合适的解决方案。 论文中在对目前存在的多种建模方法及求解方法进行综合比较之后，结合整 数规划跟线性规划的特点，提出了一种先利用树搜索算法求解可行下料方式，建 立使用材料最少的数学模型，然后利用Matlab数学库中线性规划求解函数结合 分枝定界法对模型进行求解的解决方案，详细介绍了基于此模型算法结构的一维 优化下料系统的设计过程，并列出了在Windows系统下的实例运行结果。此外又对 二、三维优化下料的模型建立和求解算法进行了探讨。 利用VisuM C++开发的系统性能稳定，用户界面友好，基本实现了优化下料、 余料管理、下料原始数据和刀口数据管理等功能。对于节约生产原材料、减少物 资储备、降低产品成本、进一步增加企业利润，都有一定程度上的重要意义。 关键词： 下料问题：整数规划；线性规划：NP一完全；模型；算法 Research Research and Development on One Dimensional Optimum Cutting System Base Linear Programming Abstract One dimensional cutting stock problem iS categorized as a claSS 0￡。 important and typical design tasks，which has been widely used in variOUS industries，SO that its solution methodology and techniques are importan L not only to itself，but also to other design problems．It iS one of the considerabiF complicated scheduling problems due to itS NP-completeness The fundamental issue iies in how to find the best corresponding retatiORS between different factors such gS Stock lengths，Stock suppl v，Piece lengths and Piece order demands．In order to satisfy SO many cons Lraints． the problem resultS in an extremely large number of sohtion sets．Hence one can hardly find absolutely satisfying solutions when dealing thi s problem in the fieId of Project Research． Through general models and algorithms comparison the combination method of linear programming and integer programming iS adopted to this total material cost minimization construct solution modelS．A search tree iS used to develop the pattern generation method and theⅣIATLAB C+十Math Library＆Branch and Bound Technique are utilized to get the optimi zation result．The one dimensional optimum cutting system base(]On thiS architecture has been implemented and tested on a WindoYvs OS based workstation．2-D and 3-D cutting stock problems are di