Improved Bacteria Foraging Optimization Algorithm for Solving Flexible Job-shop Scheduling Problem
WANG Xingang
YI Pengfei
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.
Keywords:bacterial foraging algorithmflexible shop schedulingreverse directionchemotaxis stepadaptive step-size
Publication Date:2018-01-01
Online Publishing Date:2025-08-15(First online date of this platform, not the publication date of the document)
Pages:5( 1094-1098 )
