# [1]吴秀丽,张志强.求解柔性作业车间调度问题的细菌算法对比及改进[J].郑州大学学报(工学版),2018,39(03):34-39.[doi:10.13705/j.issn.1671-6833.2017.06.018] 　Wu Xiuli,Zhang Zhiqiang.The Comparison and Improvement of Bacterial Algorithms for Flexible Job Scheduling Problem[J].Journal of Zhengzhou University (Engineering Science),2018,39(03):34-39.[doi:10.13705/j.issn.1671-6833.2017.06.018] 点击复制 求解柔性作业车间调度问题的细菌算法对比及改进() 分享到： var jiathis_config = { data_track_clickback: true };

39卷

2018年03期

34-39

2018-05-10

## 文章信息/Info

Title:
The Comparison and Improvement of Bacterial Algorithms for Flexible Job Scheduling Problem

Author(s):
School of Mechanical Engineering, University of Science and Technology Beijing, Beijing, 100083

Keywords:
DOI:
10.13705/j.issn.1671-6833.2017.06.018

A

Abstract:
The article aimed to fully explore the ability of bacterial algorithin and its varieties for solving the discrete optimization problems.The bacterial chemotaxis algorithm(BC), bacterial colony chemotaxis algorithm, bacterial evolutionary algorithm(BEA), bacterial swarming algorithm(BSA) and bacterial foraging optimization algorithm(BFO) are designed to solve the flexible job scheduling problem. Firstly, the model of the flexible job scheduling problem was formulated. Then the five algorithms were designed to solve the benchmark was instance. The results showed that the BFO outperformed the others Furthermove,a strategy to improve the BFO was proposed. More than ten optimization operators were designed and compared. Finally, the best structure of the improved BFO was built. The numerical experiments showed that the proposed BFO balanced the exploration and the exploitation very well and could solve FJSP effectively.

## 相似文献/References:

[1]丁 凯,赵欣悦,吕景祥,等.改进天牛群算法在柔性作业车间调度中的应用[J].郑州大学学报(工学版),2024,45(03):111.[doi:10. 13705/ j. issn. 1671-6833. 2024. 03. 012]
DING Kai,ZHAO Xinyue,LYU Jingxiang,et al.Improved Beetle Swarm Optimization Algorithm for Flexible Job-shop Scheduling[J].Journal of Zhengzhou University (Engineering Science),2024,45(03):111.[doi:10. 13705/ j. issn. 1671-6833. 2024. 03. 012]