Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule

Abstract

This article proposes a novel differential evolution algorithm based on dynamic multi-population (DEDMP) for solving the multi-objective flexible job shop scheduling problem. In DEDMP, at each generation, the whole population is divided into several subpopulations by the clustering partition and the size of the subpopulation is dynamically adjusted based on the last search experience. Furthermore, DEDMP is adaptive based on two search strategies, one with strong exploration ability and the other with strong exploitation ability. The selection probability of each search strategy is also dynamically adjusted according to the success rate. Furthermore, the proposed algorithm adopts newly designed mutation and crossover operators and it can directly generate feasible solutions in the search space. To evaluate the performance of DEDMP, DEDMP is compared with some state-of-the-art algorithms on benchmark instances. The experimental results show that DEDMP is better than or at least competitive with other outstanding algorithms.

KEYWORDS:

• Flexible job shop scheduling problem
• differential evolution algorithm
• multi-objective optimization
• multiple subpopulations
• strategy adaptation

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by LiaoNing Revitalization Talents Program, China [XLYC1808009].