Hybrid Quantum Algorithm for Permutation Flow Shop Problem

摘要：

Quantum evolutionary algorithm(QEA)was a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA was quantum computation. The algorithm made use of interference and parallelism of qubits thoroughly,which enabled QEA to solve combinatorial optimization problems. QEA had flaws that it would converge slowly and didnt use other immature individuals.Besides,qubits coding could not be applied conveniently when solving scheduling problems. To overcome the above flaws,two types of coding were brought forward. QEA included particle swarm optimization algorithm(PSO)and evolutionary computation on the basis of coding,and was denoted as Hybrid quantum algorithm(HQA). Classical permutation flow shop problems were employed to test the algorithm,and the results showed that hybrid algorithm overcame the flaws of QEA and it had universality to solve scheduling problems.

关键词： quantum evolutionary algorithm qubit particle swarm optimization algorithm hybrid quantumalgorithm

作者: Jiaqi Fu Chunming Ye Lulu Zhu

作者单位: College of Business,University of Shanghai for Science and Technology,Shanghai 200093,China

会议类型: 国际会议

会议名称: 2008 International Conference on System Management(2008年系统管理学术研讨会)(2008 CSM)

会议地点: 上海

会议语种:英文

页码: 323-327

在线出版日期: 2008-05-30（万方平台首次上网日期，不代表论文的发表时间）