The improved ant colony algorithm gives a fine solution to solve the permutation flow shop scheduling problems, the main reason is based on the adaptive operation, speeding up the convergence, saving search time; adding to the mutation operation, making the solution process to avoid the cause stagnation (stagnation) in the space confined to a closed local phenomenon. By adding noise operation, the algorithm has the ability to snap back, which allows the probability to abandon some of the performance growth rate. The adaptive operation, mutation operation, and noise operation joined in the algorithm reasonably, and the algorithm has a certain degree of optimization, but it is still necessary to further study how to improve the optimization efficiency.
展开▼
