协同混合粒子群算法求解车间作业调度问题  

Cooperative hybrid particle swarm optimization algorithm for job-shop scheduling problems

作　　者：吴琼[1] 纪志成[1] 吴定会[1] 

机构地区：[1]江南大学物联网工程学院

出　　处：《计算机工程与应用》2016年第5期266-270,共5页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863)(No.2013AA040405);江苏省产学研联合创新资金-前瞻性联合研究项目(No.BY2012055)

摘　　要：针对如何有效解决车间作业优化调度问题,提出一种协同粒子群和引力搜索的混合算法。新算法在粒子群算法进化停滞时引入引力搜索算法,利用引力搜索算法进化后期快速寻优的能力,及时跳出局部最优,保证全局最优。同时采用协同原理简化算法结构,提高算法收敛速度。将提出算法对车间作业调度典型测试用例进行仿真,仿真结果表明该算法较PSO和GA等算法在求解车间作业调度问题上更具优越性。To solve the Job-shop Scheduling Problem（JSP）, a novel optimization algorithm, named as Cooperative Hybrid Particle Swarm Optimization（CHPSO）, which combines Particle Swarm Optimization（PSO）algorithm and Gravitational Search Algorithm（GSA）is presented in this paper. In CHPSO, GSA is embedded to jump out of local optimum timely and guarantee the global optimum when the PSO evolution process falls into premature convergence. Also, to simplify CHPSO＇s structure and improve the convergence speed, the cooperative principle is introduced. The proposed algorithm is performed for JSP typical test cases. The simulation results show the CHPSO algorithm obtains higher efficiency than PSO and GA algorithm for solving JSP.

关 键 词：粒子群算法 引力搜索算法 车间作业调度 协同 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]