首页> 外文会议>2010 IEEE International Conference on Progress in Informatics and Computing >Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by AIA
【24h】

Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by AIA

机译:AIA生产精炼铜带中冶炼炉料的分组批次和分选顺序的优化

获取原文

摘要

Grouping batch and sorting order (GBSO) for smelting charges is a key cycle in refined copper strip producing. To improve its scientific degree, optimization problem of GBSO for smelting charges in refined copper strip producing by artificial immune algorithm (AIA) is studied. The multi-objective optimization model for GBSO of smelting charges is established with the objectives which includes minimizing fluctuation in ingredient ratios between the nearest neighbor charges, meeting order priority requirement as much as possible, insuring order due date as much as possible, maximizing number of same brand charges and sorting order in continuous way for same order as much as possible. Some constraints are adequately considered, which includes order due data of each charge, sorting order limit for the charge with high quality requirement, sorting order limit for the charge with the high ratio of virtual orders, sorting order limit for the charge including multi-order, sorting order continuously for same brand charges, ingredient ratio limit for the charge which is sorted order as the first charge, ingredient ratio difference limit between each two nearest neighbor charges. To solve the model in easy way, some constraints are transformed into the objective function, and AIA is designed. The detail steps of AIA is designed in detail including antibody representation and encoding, affinity calculation, clone selection, antibody population updating. To validate the validity of above model and AIA, select practical typical GBSO problem of smelting charges as application instance. Application result shows that, the obtained optimal solution is better than that by heuristic method both on diversity and optimization degree. AIA is suitable for solving complex problem with requirement on solution diversity.
机译:冶炼装料的分组批次和分类顺序(GBSO)是精炼铜带生产中的关键周期。为了提高科学度,研究了GBSO优化人工免疫算法生产精炼铜带中冶炼炉料的问题。建立冶炼炉料GBSO的多目标优化模型,其目标包括最大程度地减少最近邻炉料之间的配料比波动,尽可能满足订单优先级要求,尽可能确保订单到期日,最大程度地增加数量。相同的品牌费用和排序顺序应尽可能以连续的方式进行。充分考虑了一些约束条件,包括每个费用的订单到期数据,具有高质量要求的费用的排序顺序限制,具有高虚拟订单比率的费用的排序顺序限制,包括多订单的费用的排序顺序限制,对于相同品牌费用的连续排序顺序,作为第一个费用排序的费用的成分比率限制,每两个最近的相邻费用之间的成分比率差限制。为了轻松地求解模型,将一些约束条件转换为目标函数,并设计了AIA。对AIA的详细步骤进行了详细设计,包括抗体表示和编码,亲和力计算,克隆选择,抗体种群更新。为了验证上述模型和AIA的有效性,选择实际典型的GBSO冶炼费问题作为应用实例。应用结果表明,所获得的最优解在多样性和优化度上均优于启发式方法。 AIA适合解决需要解决方案多样性的复杂问题。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号