规划求解法优化及应用研究  

Research on Optimization and Application of Programming Solution Method

作　　者：贾春玉 刘鑫如 JIA Chun-yu;LIU Xin-ru(Guangdong Peizheng College,Guangzhou Guangdong 510830,China)

机构地区：[1]广东培正学院,广东广州510830

出　　处：《吉林工程技术师范学院学报》2023年第5期92-96,共5页Journal of Jilin Engineering Normal University

基　　金：广东培正学院项目(22PZXJYB007)。

摘　　要：产品品种较少、下料方案众多时下料问题是复杂组合优化问题,有效解法较少,相关问题主要解法是规划解法和人工智能算法。规划求解法在问题规模小时比较有效,规模大时会出现“组合爆炸”,影响应用推广。人工智能算法繁琐、求解时间长、有些方法易陷入局部最优、容易陷入早熟、停滞的缺点,不如规划求解优化程度高。为了克服这些问题、有效运用规划解法,提出新的一大一小简便解法,新解法选择代表性好、优化程度高的下料方案,入选下料方案有限,求解效率高、方法简单、易于掌握、优化程度高。The cutting stock problem is a complex combinatorial optimization problem with few effective solutions for scenarios with few product types and many cutting schemes,and the main solutions to related problems are programming solution and artificial intelligence algorithms.Programming method is more effective when the scale of the problem is small,but“combination explosion”will occur when the scale is large,which will affect the application and popularization.Artificial intelligence algorithm is cumbersome and often takes a long time,some of which are easy to fall into the traps which is locally optimal,premature and stagnant,and the degree of optimization is not as high as that of planning solution.In order to overcome these problems and effectively use the programming solution,a new simple solution,one big and one small,is proposed.The new solution selects cutting schemes with good representativeness and high degree of optimization,and the selected cutting schemes are limited,with high efficiency,simple method,easy mastery and high degree of optimization.

关 键 词：下料方案 规划求解法 一大一小简便解法 

分 类 号：F252[经济管理—国民经济]