首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求解作业车间调度问题的混合QPSO算法
引用本文:付振奥,刘心报,程浩,周谧.求解作业车间调度问题的混合QPSO算法[J].合肥工业大学学报(自然科学版),2009,32(3).
作者姓名:付振奥  刘心报  程浩  周谧
作者单位:合肥工业大学,管理学院,安徽,合肥,230009
基金项目:国家高技术研究发展计划(863计划) 
摘    要:文章使用混合量子粒子群优化算法求解作业车间调度问题,并设计了一种基于工序的编码方式;为了克服量子粒子群优化算法容易陷入局部最优的缺点,将模拟退火算法引入量子粒子群优化算法,使算法具有跳出局部最优的能力并增强其全局搜索能力,形成量子粒子群-模拟退火调度算法;仿真结果表明,混合算法具有良好的全局收敛性能.

关 键 词:量子粒子群优化算法  模拟退火算法  作业车间调度问题

Hybrid QPSO algorithm for job shop scheduling problems
FU Zhen-ao,LIU Xin-bao,CHENG Hao,ZHOU Mi.Hybrid QPSO algorithm for job shop scheduling problems[J].Journal of Hefei University of Technology(Natural Science),2009,32(3).
Authors:FU Zhen-ao  LIU Xin-bao  CHENG Hao  ZHOU Mi
Institution:School of Management;Hefei University of Technology;Hefei 230009;China
Abstract:A hybrid quantum particle swarm optimization(QPSO) algorithm for the job shop scheduling problem is proposed and a coding method based on the order is designed in this paper.In order to resolve the flaw of the quantum particle swarm optimization algorithm that it is easily trapped into local optimization,the hybrid algorithm combines the QPSO algorithm and the simulated annealing algorithm so that it can escape from local optima,and its global search ability is also improved.The simulation results show that...
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号