计算机与数字工程2018，Vol.46Issue(6)：1094-1098,5.DOI:10.3969/j.issn.1672-9722.2018.06.006
改进型细菌觅食算法求解FJSP问题
Improved Bacteria Foraging Optimization Algorithm for Solving Flexible Job-shop Scheduling Problem
摘要
Abstract
Bacterial foraging algorithm(BFO),as a new algorithm has been applied in many fields. This paper proposes an improved bacteria foraging optimization algorithm,key step and the movement of chemotactic operation reverse direction is im?proved,the adaptive step length is designed under the condition of three kinds of changes in value,and the global optimal position and the position in the reverse direction of individual optimal guidance are strengthened,premature phenomenon of the algorithm is avoided. The modified bacterial foraging algorithm is applied to solve the flexible simulation experiment carried out in the shop scheduling. By example analysis of classic examples,the experimental results and standard bacteria algorithm and improved genetic algorithm are analyzed and compared,verified in this paper,the improved algorithm has better convergence and higher accuracy for optimum.关键词
细菌觅食算法/柔性车间调度/翻转方向/趋化步长/自适应步长Key words
bacterial foraging algorithm/flexible shop scheduling/reverse direction/chemotaxis step/adaptive step-size分类
信息技术与安全科学引用本文复制引用
王新刚,衣鹏飞..改进型细菌觅食算法求解FJSP问题[J].计算机与数字工程,2018,46(6):1094-1098,5.
