4.6 Article

A Cooperative Coevolution Algorithm for the Seru Production With Minimizing Makespan

Journal

IEEE ACCESS
Volume 7, Issue -, Pages 5662-5670

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2889372

Keywords

Cooperative coevolution; manufacturing; makespan; Seru production

Funding

  1. National Natural Science Foundation of China [71571037, 71831006, 71601089, 71420107028, 71620107003]
  2. Fundamental Research Funds for the Central Universities [N160402002, N170405005]

Ask authors/readers for more resources

Seru production can be used to enhance productivity, such as makespan reduction and manpower saving. Seru system operation includes two NP-hard problems, i.e., seru formation and seru scheduling. The exact solution cannot be obtained by solving only one of seru formation and seru scheduling. We develop a cooperative coevolution algorithm for the Seru production with minimizing makespan by solving the seru formation and seru scheduling simultaneously. The cooperative coevolution algorithm includes two evolution algorithms, i.e., the algorithm combining generic algorithm and local search, and the ant colony optimization algorithm. The former algorithm is used to deal with the evolution of seru formation. The latter is used to find a better seru scheduling. In the cooperative mechanism, the two algorithms cooperate to seek a better solution of seru system operation. Finally, extensive-tested experiments show that the proposed cooperative coevolution algorithm can obtain a better solution than all the existing algorithms and, even, can obtain the exact solution for some medium-and-small instances.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available