Improved bacteria foraging optimization algorithm for Job-Shop scheduling problems
改进细菌觅食算法求解车间作业调度问题*

This paper designed an improved adaptive chemotactic step and differential evolution for solving local-optimal and premature problems in the large multi-dimension optimization problem, and applied this new algorithm to optimizing JSP.When dealing with JSP, adopted a code conversion to optimize JSP without changing the BFOA rule; and also introduced free time optimization strategy to reduce complexity of problems. Numerical simulation shows that the new algorithm has avoided local-optimal and premature problems, and is superior to standard BFOA and discrete PSO algorithm.