.png){kind=icon}
.png){kind=icon}
Return
Multi-population cooperative multi-objective evolutionary algorithm for sequence-dependent group flow shop with consistent sublots
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2023.121594.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Inspired by the production model of pressure vessels for spacecraft, i.e., tanks and cylinders, this study addresses the sequence-dependent group flow shop scheduling problem with consistent sublots (SDGFSP_CS) to minimize makespan and total energy consumption. In the problem under consideration, there are several coupling subproblems, namely, the group sequencing, job sequencing, lot assignment, and machine speed assignment. To solve these problems, a multi-population cooperative multi-objective evolutionary algorithm (MPCMOEA) is proposed. In the MPCMOEA, a hybrid initial method that combines two problem-specific heuristics is designed to generate high-quality initial solutions. Then, considering the problem features, a cooperative mechanism considering the co-evolution of multi-population and the archive set is designed to accelerate the optimization process. In the co-evolutionary stage, to deepen the exploitation ability of local search, an enhanced search with multiple problem-specific operators is implemented. Furthermore, a re-initialization method is developed to improve the global search abilities. Finally, 27 different scale instances are generated for a series of numerical experiments. For the hypervolume and inverse generational distance metrics, MPCMOEA gets 20/27 and 21/27 optimal values, respectively. It verifies that the MPCMOEA outperforms efficient algorithms in terms of the diversity and convergence performance.
Keywords:
Group flow shop scheduling
Sequence -dependent setup time
Multi -population
Multi -objective evolutionary algorithm
Consistent sublots
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W