求解柔性作业车间调度问题的VEDFA算法与实现  

VEDFA algorithm for flexible job-shop scheduling problem and its implementation

作　　者：孙斌 余杰 吉卫喜 王煜 

机构地区：[1]江南大学机械工程学院,无锡214122

出　　处：《现代制造工程》2015年第11期39-44,共6页Modern Manufacturing Engineering

基　　金：江苏省六大人才高峰资助项目(2010-JXQC-089);江苏省产学研联合创新资金项目(SBY2014020479)

摘　　要：针对柔性作业车间调度问题(Flexible Job-Shop Problem,FJSP)的特点以及求解方法,提出了病毒离散萤火虫算法(Virus co-Evolution Discrete Firefly Algorithm,VEDFA)来求解FJSP。该算法采用启发式规则与随机的方法产生初始种群,并对标准萤火虫算法进行改进,提出一种离散萤火虫算法。将病毒遗传算法中的病毒个体引入离散萤火虫算法(Discrete Firefly Algorithm,DFA)以加强局部搜索能力与动态搜索能力,并使用Interchange邻域结构的局部搜索来改善最优解。最后通过实验证明了该算法可以很好地解决FJSP。Through studying the features for Flexible Job-Shop Problem （FJSP） and the solution method,Virus co-Evolution Discrete Firefly Algorithm （VEDFA） is proposed to solve FJSP. This algorithm uses heuristic rules and random to generate initial population, and improving the standard firefly algorithm, proposes a discrete firefly algorithm. The virus individual of virus genetic algorithm is introduced into Discrete Firefly Algorithm （DFA） to enhance the local Search ability and dynamic search capability and using local search with Interchange neighborhood structure to improve the optimal solution. Finally, the experiment proved that the algorithm can solve FJSP well.

关 键 词：柔性作业车间调度 启发式规则 病毒离散萤火虫算法 领域结构 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]