An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem. (17th December 2015)

• Record Type: Journal Article
• Authors: Deng, Guanlong; Wei, Ming; Su, Qingtang; Zhao, Mei
• Is Part Of: Advances in mechanical engineering. Volume 7:Number 12(2015:Dec.)
• Publication Date: 2015-12-17
• Subjects: Genetic algorithm -- no-wait flow shop -- scheduling -- competitive co-evolution -- evolutionary algorithm; Mechanical engineering -- Periodicals; 621.05
• DOI: 10.1177/1687814015622900
• Languages: English
• ISSNs: 1687-8132

Abstract

This article proposes a competitive co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem with the criterion to minimize makespan, which is a renowned NP-hard combinatorial optimization problem. An innovative coding and decoding mechanism is proposed. The mechanism uses square matrix to represent the quantum individual and adapts the quantum rotation gate to update the quantum individual. In the algorithm framework, the store-with-diversity is proposed to maintain the diversity of the population. Moreover, a competitive co-evolution strategy is introduced to enhance the evolutionary pressure and accelerate the convergence. The store-with-diversity and competitive co-evolution are designed to keep a balance between exploration and exploitation. Simulations based on a benchmark set and comparisons with several existing algorithms demonstrate the effectiveness and robustness of the proposed algorithm.