柔性作业车间调度的分布式粒子群优化算法  

A Distributed Particle Swarm Optimization Zlgorithm for Flexible Job-shop Scheduling Problem

作　　者：刘胜辉[1] 任娟[1] 张淑丽[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2017年第3期1-7,共7页Journal of Harbin University of Science and Technology

基　　金：国家自然科学基金(51375128);黑龙江省教育厅科学技术研究项目(12541159)

摘　　要：针对柔性作业车间调度问题的特性,提出了一种分布式粒子群优化算法以求解柔性作业车间调度问题,该算法以最小化最大完工时间为目标,为解决传统粒子群算法在遇到突发事件时不能实时进行响应做出合理决策的问题,在算法中设计了两个多Agent粒子群优化模型。最后,使用经典算例对算法进行了验证,实验表明多Agent粒子群优化模型具有合理性,该算法能够有效解决柔性作业车间调度问题。According to the characteristics of the Flexible job shop scheduling problem, the minimum makespan as measures,we proposed a distributed particle swarm optimization algorithm aiming to solve flexible job shop scheduling problem. The algorithm adopts the method of distributed ideas to solve problems and we are established for two multi-agent particle swarm optimization model in this algorithm,it can solve the traditional particle swarm optimization algorithm when making decisions in real time according to the emergencies. Finally,some benthmark problems were experimented and the results are compared with the traditional algorithm.Experimental results proved that the developed distributed PSO is enough effective and efficient to solve the FJSP and it also verified the reasonableness of the multi-agent particle swarm optimization model.

关 键 词：柔性作业车间调度 粒子群优化 分布式 多AGENT系统 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]