| 基于改进蚁群算法的炼铁原料混匀过程调度优化 |
| |
| 引用本文： | 胡凯林,李平. 基于改进蚁群算法的炼铁原料混匀过程调度优化[J]. 上海交通大学学报, 2011, 45(8): 1105-112 |
| |
| 作者姓名： | 胡凯林 李平 |
| |
| 作者单位： | （浙江大学 工业控制研究所，杭州 310027） |
| |
| 基金项目： | 国家高技术研究发展计划(863)项目(2006AA04Z184) |
| |
| 摘 要： | 通过将炼铁原料混匀过程转化为一种带有顺序相关准备时间、有限中间存储和组装过程的流水车间问题，建立了以最小完成时间为目标的离散调度模型，并针对炼铁原料混匀过程提出了一种改进蚁群算法.该算法通过为单个蚂蚁设置禁忌定时器，将中间存储的状态变化用于修正蚁群路径选择的可行集，减少了调度过程中阻塞造成的时间浪费，构造出质量更好的可行解.数值仿真实验表明，该算法比遗传算法和一般蚁群算法具有更高的计算效率和更好的求解效果.
|
| 关 键 词： | 炼铁原料混匀 流水车间调度 禁忌定时器 蚁群算法 |
| 收稿时间： | 2011-04-22 |
The Optimized Scheduling for Iron-Making Bulk Ore Blending Process Based on Improved Ant Colony Optimization |
| |
| HU Kai-lin,LI Ping. The Optimized Scheduling for Iron-Making Bulk Ore Blending Process Based on Improved Ant Colony Optimization[J]. Journal of Shanghai Jiaotong University, 2011, 45(8): 1105-112 |
| |
| Authors: | HU Kai-lin LI Ping |
| |
| Affiliation: | （Institute of Industrial Process Control, Zhejiang University, Hangzhou 310027, China） |
| |
| Abstract: | A discrete scheduling model for the iron-making bulk ore blending process was proposed by converting the process into a two stage assembly flow shop with sequence-depended setup times and limited intermediate buffer.To find the optimal solutions of this problem,an improved ant colony optimization(ACO) algorithm was also proposed,in which a tabu timer is set for each ant to correct the feasible path set.And the efficiency and solution quality of this algorithm for solving this particular scheduling problem i... |
| |
| Keywords: | bulk ore blending flow shop scheduling tabu timer ant colony optimization |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海交通大学学报》浏览原始摘要信息 |
|
点击此处可从《上海交通大学学报》下载全文 |
