Permutation flowshop scheduling problem (PFSP) is a classical NP-hard combinatorial optimization problem, which provides a challenge for evolutionary algorithms.Since it has been shown that simple evolutionary algorithms cannot solve the PFSP efficiently, local search methods are often adopted to improve the exploitation ability of evolutionary algorithms. In this paper, a hybrid differential evolution algorithm is developed to solve this problem. This hybrid algorithm is designed by incorporating a dynamic variable neighborhood search (DVNS) into the differential evolution. In the DVNS, the neighborhood is based on multiple moves and its size can be dynamically changed from small to large so as to obtain a balance between exploitation and exploration. In addition, a population monitoring and adjusting mechanism is also incorporated to enhance the search diversity and avoid being trapped in local optimum.Experimental results on benchmark problems illustrated the efficiency of the proposed algorithm.
Stochastic Diffusion Binary Differential Evolution to Solve Multidimensional Knapsack Problem