Cooperative hybrid evolutionary algorithm for large scale multi-stage multi-product batch plants scheduling problem

摘要

As an important part of batch chemical industry scheduling problems, the multi-stage multi-product batch plant scheduling problem (MMSP) has been widely studied for decades. This problem is character-ized by multiple stages with non-identical parallel units and operate based on customer orders. In this paper, we focus on the large scale MMSP and treat the minimization of make-span as the objective function. An efficient cooperative hybrid evolutionary algorithm is proposed based on the framework of cooperative co-evolution. First, a novel two-line encoding scheme is developed to represent the unit assignment and sequencing for orders respectively. Second, modified estimation of distribution algorithm (EDA) and differential evolutionary (DE) operations are proposed according to the feature of MMSP. EDA operation with a novel population-based incremental learning strategy is applied to handle the unit assignment variables. And novel DE operation based on a novel encoding method is adopted to deal with sequence variables. Then, two selection strategies are applied to preserve optimal and sub-optimal solutions for the proposed algorithm. The critical path based local search algorithm is adopted to further improve the efficiency of local optimization. The proposed algorithm has been tested by several instances with different sizes and characteristics. The numerical results and comparisons show that the proposed work is very competitive in solving large scale MMSP. (c) 2020 Elsevier B.V. All rights reserved.