基于贪婪最佳优先搜索算法的方形件排样优化问题研究  

Research on Layout Optimization of Square Parts Based on Greedy Best First Search Algorithm

作　　者：刘艳丽 李军祥[1] LIU Yanli;LI Junxiang(School of Management,University of Shanghai for Science and Technology,Shanghai 200093,China)

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《物流科技》2023年第23期60-64,共5页Logistics Sci-Tech

基　　金：国家自然科学基金青年项目(72701130);国家自然科学基金青年项目(71871144)。

摘　　要：方形件排样优化问题是运筹学应用的重要领域,也是实现产品个性化定制的关键,如何提高材料利用率是制造企业的一大难题。文章针对该问题充分考虑各种情形下的约束条件,建立了以板材原片利用率及生产效率最大为目标的混合整数规划模型。运用Matlab进行仿真,针对多个数据集,采用贪婪最佳优先搜索算法求解出其最优的方形件排样方案,验证了模型的有效性和可行性。实验结果表明,文章的算法可以有效减少板材用量,且计算时间满足实际应用需要,能够为实际生活中制造企业涉及到的玻璃、钢材切割等问题提供新的启发和思路。The optimization of square parts layout is an important field in the application of operations research,and is also the key to realize product customization.How to improve the utilization rate of materials is a big problem for manufacturing enterprises.In order to solve this problem,a mixed integer programming model with the maximum utilization rate and production efficiency of sheet metal was established by considering the constraints under various situations.Matlab was used for simulation,and the greedy best first search algorithm was used to solve the optimal square parts layout scheme for multiple data sets,which verified the effectiveness and feasibility of the model.The experimental results show that the algorithm in this paper can effectively reduce the consumption of sheet metal,and the calculation time can meet the needs of practical applications,and can provide new inspiration and ideas for the glass and steel cutting problems involved in the real life manufacturing enterprises.

关 键 词：方形件 排样优化 板材利用率 贪婪最佳优先搜索算法 

分 类 号：F273[经济管理—企业管理]