Improved imperial competition algorithm for solving the multiworkshop integrated scheduling problem

Aiming at the multi-shop integrated scheduling problem of processing and assembly of a single complex product, a multiobjective optimization model was established and an improved Empire competition algorithm (ICA) was designed. The algorithm used a variety of rules to mix and initialize the population, balanced the imperial power during empire initialization, increased the learning of other empires on the strongest empire during assimilation, designed five kinds of neighborhoods in the revolution stage and adopted different search strategies for the empire and colony, increased colonial education and reform of the weakest empire in the competition stage to obtain high-quality solutions, and supplemented the assembly process based on greedy algorithm. Finally, the effectiveness of the improved ICA in solving this problem is verified by a large number of examples.