Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by AIA
文献类型：会议论文
| 作者 | Chang CG(常春光) ; Zhu YL(朱云龙); Hu KY(胡琨元); Zhang Y(张毅)
|
| 出版日期 | 2010 |
| 会议名称 | 2010 1st IEEE International Conference on Progress in Informatics and Computing, PIC 2010 |
| 会议日期 | December 10-12, 2010 |
| 会议地点 | Shanghai, China |
| 关键词 | Algorithms Antibodies Cloning Copper Heuristic methods Information science Multiobjective optimization Problem solving Refining Sorting Strip metal |
| 页码 | 40-43 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议主办者 | IEEE Beijing Section; Shanghai Jiao Tong University; University of Texas at Dallas (UTD); Osaka University |
| 会议录 | Proceedings of the 2010 IEEE International Conference on Progress in Informatics and Computing, PIC 2010
 |
| 会议录出版者 | IEEE Computer Society |
| 会议录出版地 | Piscataway, NJ |
| 语种 | 英语 |
| ISBN号 | 978-1-4244-6786-0 |
| 源URL | [http://ir.sia.cn/handle/173321/8380]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Chang CG,Zhu YL,Hu KY,et al. Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by AIA[C]. 见:2010 1st IEEE International Conference on Progress in Informatics and Computing, PIC 2010. Shanghai, China. December 10-12, 2010. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。