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

求解柔性Job-shop调度问题的混合粒子群算法
引用本文:宋存利,时维国.求解柔性Job-shop调度问题的混合粒子群算法[J].大连铁道学院学报,2013(6):103-107.
作者姓名:宋存利  时维国
作者单位:大连交通大学软件学院,辽宁大连116028
基金项目:国家自然科学基金资助项目(61034003);辽宁省教育厅高等学校科学研究计划资助项目(L2010086)
摘    要:针对柔性Job-shop调度问题,提出了一种混合粒子群算法,该算法对设备分配和工序调度采用不同的编码方法和更新方式,提出了基于设备的初始化算法和基于工件序列的初始化算法来提高PSO初始种群的质量,同时提出了4种不同的邻域结构,分别实现了基于此四种邻域结构的模拟退火搜索算法,将它与粒子群算法进行有效混合来提高粒子群算法的局部搜索能力,实验表明HPSO的有效性.

关 键 词:粒子群算法  柔性Job-shop调度问题  模拟退化算法

A Hybrid Particle Swarm Optimization Algorithm for Flexible Job-Shop Scheduling Problem
SONG Cun-liSoftware Institute,Dalian Jiaotong University,Dalian,China SHI Wei-guo.A Hybrid Particle Swarm Optimization Algorithm for Flexible Job-Shop Scheduling Problem[J].Journal of Dalian Railway Institute,2013(6):103-107.
Authors:SONG Cun-liSoftware Institute  Dalian Jiaotong University  Dalian  China SHI Wei-guo
Institution:SONG Cun-li(Software Institute, Dalian Jiaotong University, Dalian 116052, China) SHI Wei-guo(Software Institute, Dalian Jiaotong University, Dalian 116052, China)
Abstract:A hybrid particle swarm optimization algorithm (HPSO) is proposed to solve the flexible job shop scheduling problem.In the algorithm,different encoding methods were proposed for assignment and sequence problem.In order to ensure the legitimacy of code for assignment,the updating formula of particles is changed.In order to improve the efficiency of algorithm,the initialization algorithm based on device and sequence is proposed to improve the quality of the initial population of HPSO.To improve the local search ability of algorithm,four simulated annealing algorithms based on different neighborhood search strategy are proposed and mixed with PSO.The computational results show the effectiveness of the algorithm.
Keywords:particle swarm optimization algorithm  flexible job shop scheduling problem  simulated annealing algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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