摘要
针对不相关并行机混合流水线调度问题的特点,设计了一种基于排列的编码和解码方法,提出了一种有效的人工蜂群算法.在引领蜂和跟随蜂搜索阶段采用3种有效的邻域搜索方法,以丰富搜索行为;在侦察蜂搜索阶段通过随机搜索对种群进行更新,以增强种群多样性.同时,通过试验设计方法对算法的参数设置进行了分析,给出指导性参数组合.通过基于典型实例的数值仿真以及与已有代表性算法的比较,验证了所提算法的有效性和鲁棒性.
According to the characteristics of the hybrid flow-shop scheduling problem with unrelated parallel machines（HFSP–UPM）,we design a permutation-based method for encoding and decoding,and propose an effective artificial bee colony（ABC） algorithm.At the employed bee phase and the onlooker bee phase,three effective neighbor-search approaches are used to enrich the searching behavior;at the scout bee phase,the population is updated by using random search to enhance the diversity of population.Based on Taguchi method for experiment design（DOE）,the effect from the parameter-setting is investigated and suitable parameter values are suggested.Numerical simulation based on benchmark examples and comparisons with the existing typical algorithms demonstrate the effectiveness and robustness of the proposed algorithm.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
2012年第12期1551-1557,共7页
Control Theory & Applications
基金
国家自然科学基金资助项目(61174189
60834004)
国家重点基础研究发展计划资助项目(2009CB320602)
关键词
混合流水线调度
不相关并行机
人工蜂群算法
实验设计
hybrid flow-shop scheduling
unrelated parallel machine
artificial bee colony
design of experiment
