作　　者： ; ; ; ;

机构地区： 西北工业大学机电学院现代设计与集成制造技术教育部重点实验室

出　　处： 《计算机工程与应用》 2013年第24期243-248,261,共7页

摘　　要： 针对柔性作业车间调度的特点,设计了柔性作业车间调度析取图模型,结合蚁群分工组织的工作方式,给出了基于竞争规则的多种群蚁群算法求解方法。算法中不同种群的蚂蚁被放置在析取图中不同的工序节点上,通过核心种群的引导,充分发挥蚁群协作竞争的并行高效特点,满足柔性作业车间调度的要求。仿真实验表明该算法求解柔性作业车间调度具有可行性和有效性。 To the characteristics of flexible job-shop scheduling, this paper designs the disjunctive graph model of the flexible job-shop scheduling and presents the solution of the multiple ant colony algorithm for the competitive rule. According to the labor mode of ant colony, different colonies are located in different processing nodes in the algorithm. By the command of core colony, all types of ant colonies with pheromone updating mechanism and searching traits have mutual compensation of advantages as well as mutual competitive exclusion so that they can potentially cooperate smoothly, and fulfill the scheduling requirements of flexible job-shop scheduling. Through the analysis of the simulating experiment results prove the feasibility and effectiveness of the algorithm.

关 键 词： 柔性作业车间调度 多种群蚁群 竞争规则 析取图

领　　域： [自动化与计算机技术] [自动化与计算机技术]