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

Chunguang Chang, Yunlong Zhu, Kunyuan Hu, Yi Zhang
{"title":"Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by AIA","authors":"Chunguang Chang, Yunlong Zhu, Kunyuan Hu, Yi Zhang","doi":"10.1109/PIC.2010.5687957","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Progress in Informatics and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2010.5687957","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
AIA生产精炼铜条冶炼炉料分组批次及分选顺序优化
冶炼炉料分组批次排序是精炼铜带生产的关键环节。为了提高该算法的科学性,利用人工免疫算法(AIA)对精炼铜带冶炼炉料的GBSO优化问题进行了研究。建立了冶炼炉料GBSO多目标优化模型,以最小近邻炉料间配料比波动、尽可能满足订单优先级要求、尽可能保证订单到期日、尽可能增加同品牌炉料数量和尽可能对同一订单连续排序为目标。充分考虑了各种电荷的应有排序数据约束、高质量要求电荷的排序顺序限制、虚拟订单比例高的电荷的排序顺序限制、包含多订单的电荷的排序顺序限制、同一品牌电荷的连续排序顺序、排序顺序为第一电荷的电荷的成分比限制、两个最近邻电荷之间的成分比差异限制。为了方便求解模型,将一些约束条件转化为目标函数,设计了AIA。详细设计了AIA的具体步骤,包括抗体表示与编码、亲和力计算、克隆选择、抗体群体更新等。为验证上述模型和AIA的有效性,选取冶炼炉料的实际典型GBSO问题作为应用实例。应用结果表明,所得到的最优解在多样性和优化程度上都优于启发式方法。AIA适用于解决对解决方案多样性有要求的复杂问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data compression of multispectral images for FY-2C geostationary meteorological satellite Redundant De Bruijn graph based location and routing for large-scale peer-to-peer system Content semantic filter based on Domain Ontology An isolated word recognition system based on DSP and improved dynamic time warping algorithm Research on Logistics Carbon Footprint Analysis System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1