期刊文献+

基于置换Flow Shop调度问题的混合量子算法研究

A Hybrid Quantum Algorithm for Permutation Flow Shop Scheduling Problems
下载PDF
导出
摘要 安排合理有效的生产调度是生产活动能井然有序开展,生产资源得到最佳配置,运作过程简明流畅的有力保证。置换Flow Shop调度问题是流水车间的典型问题,同时也是NP-C难题。从问题出发,设计了由量子进化,最佳模式和其他优化技术所构成的混合量子算法(HQA)。HQA模仿量子行为迭代演化,将种群一分为二,种群1在量子作用和其他优化作用下,探索解空间。种群2保留最佳模式,提高了搜索的效率。经计算测试,验证了HQA在求解排序问题中的可行性,测试结果表明HQA具备了求解置换Flow Shop调度问题的能力。 Arranging feasible and effective production scheduling enables production activities to unfold orderly, allows production resources to achieve best configuration and guarantees operation process to be simple and easy. Permutation Flow Shop scheduling problems are classical problems in Flow Shop, and they are also NP-C problems. Proceeding from the characteristics of the problems, hybrid quantum algorithm (HQA) is designed, which contains quantum evolution, best-mode evolution and other optimization techniques. HQA involves imitating quantum behaviors, dividing one population into two smaller populations. The first population explores solution space with the help of quantum evolution and other optimization technique, while the second population keeps best mode and enables HQA to search more efficiently. The feasibility of HQA in solving scheduling problems is demonstrated by tests. The results of several tests have shown the capability of HQA to solve permutation Flow Shop scheduling problems.
出处 《机械科学与技术》 CSCD 北大核心 2010年第1期113-118,共6页 Mechanical Science and Technology for Aerospace Engineering
基金 国家自然科学基金项目(70672110) 上海市(第三期)重点学科项目(S30504)资助
关键词 混合量子算法 优化 置换Flow Shop调度问题 hybrid quantum algorithm optimization permutation Flow Shop scheduling problem
  • 相关文献

参考文献8

二级参考文献43

  • 1张玉萍,张春丽,蒋寿伟.皮料优化排样的有效方法[J].软件学报,2005,16(2):316-323. 被引量:16
  • 2杨海英,黄皓,窦全胜.基于文化算法的负载均衡自适应机制[J].计算机工程与应用,2005,41(21):146-148. 被引量:8
  • 3蒙祖强,蔡自兴.一种新的计算方法:粒度进化计算[J].计算机工程与应用,2006,42(1):5-8. 被引量:10
  • 4刘纯青,杨莘元,张颖.基于文化算法的聚类分析[J].计算机应用,2006,26(12):2953-2955. 被引量:14
  • 5Reeves C R.A genetic algorithm for flow shop sequencing[J].Computers and Operations Research,1995;22(1):5~13
  • 6Osman I H,Potts C N.Simulated annealing for permutation flow-shop scheduling[J].Omega,1989;17(6):551~557
  • 7Nowicki E,Smutnieki C.A fast tabu search algorithm for the permutation flow-shop problem[J].European Journal of Operational Research,1996 ;91(2):160~175
  • 8Ben-Daya M,A1-Fawzan M.A tabu search approach for the flow shop scheduling problem[J].European Journal of Operational Research,1998;109(1):88~95
  • 9Carlier J,Rebai I.Two branch and bound algorithms for the permutation flow shop problem[J].European Journal of Operational Research,1996;90(2):238~251
  • 10Garey M,Johnson D,Sethy R.The complexity of flow shop and job shop scheduling[J].Mathematics of Operations Research,1976;1(2):117~129

共引文献77

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部