Li Bin-Bin, Wang Ling
Department of Automation, Tsinghua University, Beijing 100084, China.
IEEE Trans Syst Man Cybern B Cybern. 2007 Jun;37(3):576-91. doi: 10.1109/tsmcb.2006.887946.
This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.
本文针对多目标流水车间调度问题(FSSP)提出了一种混合量子启发式遗传算法(HQGA),该问题是一个具有强大工程背景的典型NP难组合优化问题。一方面,基于量子比特表示的量子启发式遗传算法(QGA)通过使用量子门的更新算子和量子比特的遗传算子,在离散的0-1超空间中进行探索。此外,采用随机键表示将量子比特表示转换为作业排列,以评估调度解的目标值。另一方面,基于排列的遗传算法(PGA)既用于在基于排列的调度空间中进行探索,又用于对良好调度解进行强化。为了从多目标角度评估解,在QGA中使用随机加权线性和函数,在PGA中针对解的接近度和多样性应用一种包括帕累托前沿分类和适应度分配的非支配排序技术。为了保持种群的多样性,提出了两种种群修剪技术。基于一些多目标FSSP对所提出的HQGA进行了测试。基于几个性能指标的仿真结果和比较证明了所提出的HQGA的有效性。