钢管生产短尺合同与非定尺合同组批优化算法  

Optimized Heuristic Algorithms for Short and Unfixed Order-grouping in Seamless Steel Tube Production

作　　者：刘桂林[1] 

机构地区：[1]宝钢分公司钢管厂,上海201900

出　　处：《宝钢技术》2007年第2期42-44,共3页Baosteel Technology

基　　金：上海市科委浦江人才计划资助项目(项目编号:06PJ14311)

摘　　要：提出了一套解决钢管生产中短尺合同和非定尺合同组批优化问题的启发式算法。其中短尺合同组批优化算法，实现了客户要求的短尺率尽量降低，短尺合同中定尺部分尽可能长，非定尺部分尽可能短，热区切割长度尽可能长，管坯长度尽量长以及满足的合同数尽量多的目标，从而实现短尺合同的优化组批。非定尺合同组批优化算法则实现了对6～12m，9～12m以及其他任意规格非定尺合同提供不同的切割方法，实现尽可能不产生废料，交货长度尽量一致的目标，从而实现对非定尺合同的的优化组批。A series of heuristic algorithms was designed to solve problems in optimization of short and unfixed order-grouping in steel tube production. Algorithm for short order-grouping has realized the objective that most tubing orders can be made. According to this algorithm, the short order rate will be reduced as gready as possible; the fixed part in a short order will be as long as possible; the unfixed part will be as short as possible; the cutting length in the hot zone will be as long as possible and the tube shell length will be as long as possible. Algorithm for unfixed order- grouping has realized the following objectives： providing cutting methods for unfixed order-grouping （6 - 12 m, 9 12 m and other random norms of steel tubes） ; generating scrap as little as possible and making the finished product length as uniform as possible.

关 键 词：无缝钢管 合同组批 短尺合同 非定尺合同 启发式算法 

分 类 号：TG335.7[金属学及工艺—金属压力加工] O242.1[理学—计算数学]