蜂群算法解决集聚约束调度问题  

A Bee Colony Optimization Algorithm for Clustering-Constraint Scheduling

作　　者：赵良辉[1] 王天擎[1] 

机构地区：[1]五邑大学管理学院,广东江门529020

出　　处：《计算机工程与科学》2011年第11期84-88,共5页Computer Engineering & Science

基　　金：广东省自然科学基金资助项目(8452902001001552)

摘　　要：为满足真实调度环境中常见的集聚约束问题,本文提出以蜂群优化为基础的调度算法,形成个性化调度方案。算法通过模仿蜂群的"觅食"和"舞蹈"行为实现寻优操作,通过赋予蜜蜂不同的"信念"实现种群的多样化,通过将集聚约束以社会规范的形式融合到蜜蜂觅食过程中满足用户对调度的个性化要求,通过蜜蜂在舞蹈过程中展示行走路径和选择参考路径实现蜂群"经验"共享。对若干标准算例的测试结果及与其它算法的比较验证了本文算法的有效性。A bee-colony-optimization based scheduling algorithm is proposed to meet the clustering constraint which often appears in real production fields. The algorithm performs its searching operation by means of imitating the bee colony＇s ＂foraging＂ and ＂waggle dance＂, including endowing bees with different ＂believes＂ to keep the searching diversification of the colony, merging the clustering constraint into bees＇ behavior as ＂social rule＂ to meet the user＇s individual demands, and sharing information among the bees through ＂waggle dance＂, i.e. making bees display their paths and choose a preferred path from others at the same time. The computational experiments on a series of JSP benchmark problems and the comparison with other algorithms validate the effectiveness of the proposed algorithm.

关 键 词：蜂群算法 作业车间调度 集聚约束 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]