{"title":"Distributed Heterogeneous Co-Evolutionary Algorithm for Scheduling a Multistage Fine-Manufacturing System With Setup Constraints","authors":"Guanghui Zhang;Bo Liu;Ling Wang;Keyi Xing","doi":"10.1109/TCYB.2022.3217074","DOIUrl":null,"url":null,"abstract":"In the context of customization and personalization, the multistage fine-manufacturing system has become emerging in modern manufacturing industries. In this study, the scheduling problem of such a system called distributed hybrid differentiation flowshop scheduling problem is addressed for the first time to minimize makespan. The manufacturing process has three dedicated stages, including distributed fabrication for jobs, assembly from jobs to products, and further differentiation for products to meet customized requirements. Due to the scheduling complexity of the problem, the evolutionary algorithm is designed. First, the population is initialized heuristically and divided into three subpopulations with different identities based on the quality. The identity will be transited dynamically along with evolution. Second, a distributed heterogeneous global exploration strategy is designed to coevolve three subpopulations. According to identity differences, different subpopulations will choose their suitable learning operators and learning strengths to make full use of superior search knowledge. Third, to enhance search intensification, a problem-specific local exploitation strategy consisting of a variable neighborhood local search and a random block local search is devised and carried out adaptively. Fourth, by organizing the global exploration and local exploitation, a novel distributed heterogeneous co-evolutionary algorithm (DHCA) is proposed. The effect of parameter setting on DHCA is investigated by design-of-experiment and computational experiments are carried out to evaluate the algorithm. The results validate the effectiveness of special designs and show that DHCA are more effective and efficient than the compared state-of-the-art algorithms in solving the considered problem.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"54 3","pages":"1497-1510"},"PeriodicalIF":10.5000,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cybernetics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/9937061/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In the context of customization and personalization, the multistage fine-manufacturing system has become emerging in modern manufacturing industries. In this study, the scheduling problem of such a system called distributed hybrid differentiation flowshop scheduling problem is addressed for the first time to minimize makespan. The manufacturing process has three dedicated stages, including distributed fabrication for jobs, assembly from jobs to products, and further differentiation for products to meet customized requirements. Due to the scheduling complexity of the problem, the evolutionary algorithm is designed. First, the population is initialized heuristically and divided into three subpopulations with different identities based on the quality. The identity will be transited dynamically along with evolution. Second, a distributed heterogeneous global exploration strategy is designed to coevolve three subpopulations. According to identity differences, different subpopulations will choose their suitable learning operators and learning strengths to make full use of superior search knowledge. Third, to enhance search intensification, a problem-specific local exploitation strategy consisting of a variable neighborhood local search and a random block local search is devised and carried out adaptively. Fourth, by organizing the global exploration and local exploitation, a novel distributed heterogeneous co-evolutionary algorithm (DHCA) is proposed. The effect of parameter setting on DHCA is investigated by design-of-experiment and computational experiments are carried out to evaluate the algorithm. The results validate the effectiveness of special designs and show that DHCA are more effective and efficient than the compared state-of-the-art algorithms in solving the considered problem.
期刊介绍:
The scope of the IEEE Transactions on Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or machine, human, and organizations. The scope includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, cognitive systems, decision making, and robotics, to the extent that they contribute to the theme of cybernetics or demonstrate an application of cybernetics principles.