{"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}
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