检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学物流优化与控制研究所辽宁省制造系统与物流优化重点实验室,沈阳110819
出 处:《自动化学报》2012年第10期1713-1720,共8页Acta Automatica Sinica
基 金:国家自然科学基金重点项目(71032004);高等学校博士学科点专项科研基金(20090042120038)资助~~
摘 要:以长材产线为背景,研究了炉次在连铸及轧制阶段的组批及批排序问题.与以往将连铸、轧制分开研究不同,本文同时考虑连铸和轧制阶段对组批及批排序的要求,还考虑了下游工序精整机组负荷均衡生产的要求.为该问题建立了新的混合整数规划(Mixed integer programming,MIP)模型.由于问题的NP-hard属性和模型的大规模特征,以及工业应用的实际要求,本文提出了改进的分散搜索(Scattersearch,SS)算法用于求解该问题.在改进的SS算法中,利用解的相关性质来限制搜索空间,并将变邻域搜索策略引入,从而结合解的多样性及邻域互补性特点,充分发挥算法混合的优势.实际数据的计算结果验证了改进SS算法的有效性.In this paper, we take the long steel production line as research background, and investigate the charge batching and batch sequencing problem on the continuous-caster and the rolling machine. Different from the previous research in which the casting and rolling stages are disjoined, in this study the batching and batch sequencing requirements on both stages are considered simultaneously, as well as the requirement on balanc-ing the workloads on different finishing machines downstream. A novel mixed integer programming (MIP) model is developed. Because of the NP-hardness of the problem and the huge size of MIP model, along with practical requirement for industry appli- cation, we propose an improved scatter search (SS) algorithm to solve the problem. In this algorithm, the search space is reduced by some optimal properties and the variable neighborhood search strategy is introduced such that the diversification and the com- plementary advantage of difference neighborhoods are combined and the merits of hybrid algorithms are exploited. The compu-tational results on practical data demonstrate the efficiency of the improved scatter search algorithm.
关 键 词:长材产线 批决策 排序 混合整数规划 分散搜索 变邻域搜索
分 类 号:TG335.9[金属学及工艺—金属压力加工]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7