摘要
为提高炼钢-连铸作业计划编制中资源配置的有效性,提出了一种面向生产流程动态网络的自组织资源配置蚁群算法.炼钢-连铸作业计划以最小化炉次作业冲突时间和作业前等待时间、尽早安排连铸机开浇时间为目标,以连铸机连浇等工艺要求为约束条件建立模型,按生产流程网络结构的时空逆序关系设计了蚁群求解算法.利用某钢厂实际生产作业计划数据进行的算法验证结果表明:模型及算法能迅速得到高质量的可执行炼钢-连铸生产作业计划.
An ant colony algorithm of self-organization resource allocation for dynamic procedure networks in production process was proposed to improve the validity of resource allocation in steel-making and continuous casting production planning. A production planning model for steel-making and continuous casting was established with sequence casting constraint. In the model, the objective is to minimize the operation conflict time and the queue waiting time and to start pouring early. The ant colony algorithm was designed on the base of the time and space reverse relation of structure of procedure networks in production process. The test with production data in a commercial steel plant shows that the model and algorithm can draw quickly a high-quality and performable production plan.
出处
《北京科技大学学报》
EI
CAS
CSCD
北大核心
2009年第4期504-510,共7页
Journal of University of Science and Technology Beijing
基金
国家高技术研究发展计划资助项目(No.2007AA04Z161)
国家自然科学基金钢铁联合基金资助项目(No.50574110)
关键词
炼钢-连铸
生产作业计划
蚁群算法
流程网络图
steel-making and continuous casting
production planning
ant colony algorithm
procedure networks
