A Quantum Immune Algorithm for Multiobjective Parallel Machine Scheduling

摘要

The study presents a novel quantum immune algorithm (QIA) for solving the parallel machine scheduling in the textile manufacturing industry. In this proposed algorithm, there are distinct characteristics as follows. First, the encoding method is based on Q-bit representation. Second, a novel mutation operator with a chaos-based rotation gate is proposed. Most importantly, two diversity schemes, suppression algorithm and similarity-based truncation algorithm, are employed to preserve the diversity of the population, and a new selection scheme is proposed to create the new population. Simulation results show that QIA is better than two quantum-inspired evolutionary algorithms.