Abstract

By addressing the flexible job shop scheduling problem (FJSP), this paper proposes a new type of algorithm for the FJSP. We named it the hybrid coronavirus population immunity optimization algorithm. Based on the characteristics of the problem, firstly, this paper redefined the discretized two-stage individual encoding and decoding scheme. Secondly, in order to realize the multi-scale search of the solution space, a multi-population update mechanism is designed, and a collaborative learning method is proposed to ensure the diversity of the population. Then, an adaptive mutation operation is introduced to enrich the diversity of the population, relying on the adaptive adjustment of the mutation operator to balance global search and local search capabilities. In order to realize a directional and efficient neighborhood search, this algorithm proposed a knowledge-driven variable neighborhood search strategy. Finally, the algorithm’s performance comparison experiment is carried out. The minimum makespans on the MK06 medium-scale case and MK10 large-scale case are 58 and 201, respectively. The experimental results verify the effectiveness of the hybrid algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.