A Cooperative Coevolution Algorithm for the <italic>Seru</italic> Production With Minimizing Makespan

Abstract

<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Seru</i> production can be used to enhance productivity, such as makespan reduction and manpower saving. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Seru</i> system operation includes two NP-hard problems, i.e., <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> formation and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> scheduling. The exact solution cannot be obtained by solving only one of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> formation and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> scheduling. We develop a cooperative coevolution algorithm for the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Seru</i> production with minimizing makespan by solving the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> formation and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> 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 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> formation. The latter is used to find a better <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> scheduling. In the cooperative mechanism, the two algorithms cooperate to seek a better solution of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">seru</i> 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.