The Comparison and Improvement of Bacterial Algorithms for Flexible Job Scheduling Problem
[1]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]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
39
Number of periods:
2018 03
Page number:
34-39
Column:
Public date:
2018-05-10
- Title:
- The Comparison and Improvement of Bacterial Algorithms for Flexible Job Scheduling Problem
- Keywords:
- flexible job scheduling problem; bacterial chemotaxis algorithm; bacterial colony chemotaxis algorithm; bacterial evolutionary algorithm; bacterial swarming algorithm; bacterial foraging optimization algorithm
- CLC:
- -
- 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:
- -
- Similar References:
Memo
-
Last Update:
2018-05-03