Chunguang Chang, Yunlong Zhu, Kunyuan Hu, Yi Zhang
{"title":"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":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"15 1\",\"pages\":\"0\"},\"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}","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}
Optimization of grouping batch and sorting order for smelting charges in refined copper strip producing by 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.