Multi-Strategy Dynamic Evolution-Based Improved MOEA/D Algorithm for Solving Multi-Objective Fuzzy Flexible Job Shop Scheduling Problem

7Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A scheduling model was developed to optimize the maximum completion time, total machine load, and maximum machine load for the fuzzy flexible job shop problem with uncertain processing times. To solve this problem, a multi-strategy dynamic evolution-based improved multi-objective evolutionary algorithm based on decomposition(IMOEA/D) was proposed. In order to enhance the quality of the non-dominated solution set and improve the algorithm efficiency. The algorithm firstly employs a strategy based on minimum processing time and workload, along with a non-dominated solution prioritization mechanism to generate the initial population. Secondly, three evolutionary strategies are incorporated, and their probabilities are dynamically adjusted with the increase of evolution generations. Finally, a variable neighborhood search method is introduced to improve the search performance of the algorithm. The effectiveness of the proposed algorithm was demonstrated through experimental validation.

Cite

CITATION STYLE

APA

Liu, Z., Liang, X., Hou, L., Yang, D., & Tong, Q. (2023). Multi-Strategy Dynamic Evolution-Based Improved MOEA/D Algorithm for Solving Multi-Objective Fuzzy Flexible Job Shop Scheduling Problem. IEEE Access, 11, 54596–54606. https://doi.org/10.1109/ACCESS.2023.3281364

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free