未知装药数炼钢装药计划的改进粒子群优化算法

Yuncan Xue, Jun Feng, Fei Liu
{"title":"未知装药数炼钢装药计划的改进粒子群优化算法","authors":"Yuncan Xue, Jun Feng, Fei Liu","doi":"10.1109/ACC.2006.1657427","DOIUrl":null,"url":null,"abstract":"An optimum furnace charge plan model with unknown charge number for steelmaking continuous casting planning and scheduling is presented. Based on the analysis of the difficult to solve the problem, a pseudo travel salesman problem model is presented to describe the plan and scheduling model. An improved particle swarm optimization with variant particle is presented to solve the optimum charge plan problem. Simulations have been carried and the results show that the pseudo travel salesman problem is very fit for describe the model. The computation with practical data shows that the model and the solving method are very effective","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modified particle swarm optimization algorithm for steelmaking charge plan with unknown charge number\",\"authors\":\"Yuncan Xue, Jun Feng, Fei Liu\",\"doi\":\"10.1109/ACC.2006.1657427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimum furnace charge plan model with unknown charge number for steelmaking continuous casting planning and scheduling is presented. Based on the analysis of the difficult to solve the problem, a pseudo travel salesman problem model is presented to describe the plan and scheduling model. An improved particle swarm optimization with variant particle is presented to solve the optimum charge plan problem. Simulations have been carried and the results show that the pseudo travel salesman problem is very fit for describe the model. The computation with practical data shows that the model and the solving method are very effective\",\"PeriodicalId\":265903,\"journal\":{\"name\":\"2006 American Control Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.2006.1657427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.2006.1657427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对炼钢连铸计划调度问题,提出了未知炉料数的最优炉料计划模型。在分析该问题求解难点的基础上,提出了一个拟旅行商问题模型来描述计划和调度模型。针对最优装药计划问题,提出了一种改进的变粒子群算法。仿真结果表明,拟旅行商问题非常适合描述该模型。实际数据的计算表明,该模型和求解方法是非常有效的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modified particle swarm optimization algorithm for steelmaking charge plan with unknown charge number
An optimum furnace charge plan model with unknown charge number for steelmaking continuous casting planning and scheduling is presented. Based on the analysis of the difficult to solve the problem, a pseudo travel salesman problem model is presented to describe the plan and scheduling model. An improved particle swarm optimization with variant particle is presented to solve the optimum charge plan problem. Simulations have been carried and the results show that the pseudo travel salesman problem is very fit for describe the model. The computation with practical data shows that the model and the solving method are very effective
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信