改进混合量子算法在Job Shop调度中的研究  

Research of improved hybrid quantum algorithm in Job Shop scheduling problems

作　　者：傅家旗[1] 叶春明[1] 谢金华[1] 赵伟民[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《计算机工程与应用》2009年第30期48-52,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.70672110;上海市重点学科资助项目No.T0502~~

摘　　要：自从科学的管理思想引进生产过程中,管理者开始注重计算机的辅助作用。JobShop调度问题(JSP)是许多实际生产调度的简化模型,由于解空间的规模巨大,给求解带来了很大的挑战。在量子比特编码的基础上,设计了两种解码方式,结合微粒群算法(PSO)的更新式对量子角进行智能调整,形成了混合量子算法(HQA)。但HQA在求解JSP时,效果并不好。在HQA的框架下,增加了一些寻优机制,使得算法求解性能有显著的提高,并称其为改进混合量子算法(IHQA)。Managers have focused a lot on the aid of computers since the introduction of scientific management concepts into production process.Job Shop scheduling problem（JSP） is a simplified model which results from many exact production scheduling problems.The tremendous solution space brings big challenge.On the basis of Q-bit coding,two types of decoding are designed, quantum angles can be adjusted intelligently with the help of Particle Swarm Optimization algorithm（PSO） and Hybrid Quantum Algorithm（HQA） is constructed.However,when HQA is employed to solve JSP,the effect is not satisfactory.Under the HQA structure,some optimization mechanisms are introduced,which dramatically improve the capability of the algorithm,and the new algorithm is denoted as Improved Hybrid Quantum Algorithm（ IHQA ）.

关 键 词：混合量子算法 优化 调度 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP301.4[自动化与计算机技术—控制科学与工程]