Competitive and Cooperative-Based Strength Pareto Evolutionary Algorithm for Green Distributed Heterogeneous Flow Shop Scheduling

作     者：Kuihua Huang Rui Li Wenyin Gong Weiwei Bian Rui Wang 

作者机构：College of System EngineeringNational University of Defense TechnologyChangsha410073China School of Computer ScienceChina University of GeosciencesWuhan430074China Equipment General Technology LaboratoryBeijing Mechanical Equipment Research InstituteBeijing100854China 

出 版 物：《Intelligent Automation & Soft Computing》 (智能自动化与软计算（英文）)

年 卷 期：2023年第37卷第8期

页      面：2077-2101页

核心收录：

学科分类：08[工学] 081104[工学-模式识别与智能系统] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.62076225 and 62122093 the Open Project of Xiangjiang Laboratory under Grant No 22XJ02003. 

主　　题：Distributed heterogeneous flow shop scheduling green scheduling SPEA2 competitive and cooperative 

摘      要：This work aims to resolve the distributed heterogeneous permutation flow shop scheduling problem(DHPFSP)with minimizing makespan and total energy consumption(TEC).To solve this NP-hard problem,this work proposed a competitive and cooperative-based strength Pareto evolutionary algorithm(CCSPEA)which contains the following features:1)An initialization based on three heuristic rules is developed to generate a population with great diversity and convergence.2)A comprehensive metric combining convergence and diversity metrics is used to better represent the heuristic information of a solution.3)A competitive selection is designed which divides the population into a winner and a loser swarms based on the comprehensive metric.4)A cooperative evolutionary schema is proposed for winner and loser swarms to accelerate the convergence of global search.5)Five local search strategies based on problem knowledge are designed to improve convergence.6)Aproblem-based energy-saving strategy is presented to reduce TEC.Finally,to evaluate the performance of CCSPEA,it is compared to four state-of-art and run on 22 instances based on the Taillard benchmark.The numerical experiment results demonstrate that 1)the proposed comprehensive metric can efficiently represent the heuristic information of each solution to help the later step divide the population.2)The global search based on the competitive and cooperative schema can accelerate loser solutions convergence and further improve the winner’s exploration.3)The problembased initialization,local search,and energy-saving strategies can efficiently reduce the makespan and TEC.4)The proposed CCSPEA is superior to the state-of-art for solving DHPFSP.