摘要
通过将炼铁原料混匀过程转化为一种带有顺序相关准备时间、有限中间存储和组装过程的流水车间问题,建立了以最小完成时间为目标的离散调度模型,并针对炼铁原料混匀过程提出了一种改进蚁群算法.该算法通过为单个蚂蚁设置禁忌定时器,将中间存储的状态变化用于修正蚁群路径选择的可行集,减少了调度过程中阻塞造成的时间浪费,构造出质量更好的可行解.数值仿真实验表明,该算法比遗传算法和一般蚁群算法具有更高的计算效率和更好的求解效果.
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 is convinced by the computational experiments.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2011年第8期1105-1112,共8页
Journal of Shanghai Jiaotong University
基金
国家高技术研究发展计划(863)项目(2006AA04Z184)