期刊文献+

基于自适应参数与混沌搜索的PSO算法求解柔性作业车间调度问题 被引量:8

Particle swarm optimization algorithm with self-adaptive parameter and chaos search for solving flexible job shop scheduling problem
下载PDF
导出
摘要 针对传统粒子群优化(PSO)算法在求解柔性作业车间调度问题中的不足,提出了基于自适应参数与混沌搜索的粒子群优化算法。对粒子群算法中的惯性系数等参数采用基于迭代搜索而自适应调整的方式,使粒子在初期以较大惯性进行大范围搜索,后期逐渐减小惯性而转入精细搜索。这种方法改变了传统粒子群算法在求解过程中的盲目随机与求解精度不高的问题;同时,通过在局部搜索过程中引入混沌技术,扩大对最优解的寻找范围,以此避免算法陷入局部最优,有效提高算法的全局寻优能力。实验结果表明,基于自适应参数与混沌搜索的粒子群优化算法在求解柔性作业车间调度问题(FJSP)时能够获得更优粒子适应度平均值及更好的优化目标。所提算法对求解柔性作业车间调度问题可行,有效。 According to the shortcomings of traditional Particle Swarm Optimization(PSO) algorithm in solving flexible job-shop scheduling problem,this paper proposed particle swarm optimization algorithm with self-adaptive parameters and chaos search.According to the self-adaptive method of parameters such as inertia coefficient based on iteration,particles searched in large scale with high inertia at early time and then got into fine search by reducing inertia.This method solved the problem of blind randomness and low accuracy in traditional particle swarm algorithm.Introduction of chaos technology into local search could expand the search scale for optimization solution and reduce the possibility of falling into local extremum.This method could effectively improve global optimization ability of the algorithm.The experimental results show that the particle swarm optimization algorithm with self-adaptive parameters and chaos search can get more optimal average particle fitness and better optimization objective.The proposed algorithm is feasible and effective for Flexible Job-shop Scheduling Problem(FJSP).
作者 李莉
出处 《计算机应用》 CSCD 北大核心 2012年第7期1932-1934,1950,共4页 journal of Computer Applications
基金 国家自然科学基金资助项目(71003020) 中央高校基本科研业务费专项(DL12BB08 DL10AB02)
关键词 柔性作业车间调度 自适应 混沌搜索 粒子群优化算法 flexible job shop scheduling self-adaptive chaos search Particle Swarm Optimization(PSO) algorithm
  • 相关文献

参考文献13

  • 1LIU MIN, SUN ZHI-JIANG, YAN JUN-WEI, et al. An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem [ J]. Expert Systems with Applications, 2011, 38 (8) : 9248 - 9255.
  • 2TANG JIANCHAO, ZHANG GUOJI, LIN BINBIN, et al. A hybrid algorithm for flexible job-shop scheduling problem [ J]. Procedia En- gineering, 2011, 15:3678-3683.
  • 3TAVAKKOLI-MOGHADDAM R, AZARKISH M, SADEGHNE- JAD-BARKOUSARAIE A. A new hybrid muhi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem [ J]. Ex- pert Systems with Applications, 2011, 38(9) : 10812 - 10821.
  • 4JAMILI A, SHAFIA M A, TAVAKKOLI-MOGHADDAM R. A hy- bridization of simulated annealing and electromagnetism-like mecha- nism for a periodic joh shop scheduling problem [ J]. Expert Systems with Applications, 2011, 38(5) : 5895 - 5901.
  • 5LIN T L, HONG S J, KAO T W, et al. An efficient job-shop sched- uling algorithm based on particle swarm optimization [ J]. Expert Systems with Applications, 2010, 37(3): 2629-2636.
  • 6CAGNINA L, ESQUIVEL S, GALLARD R. Particle swarm optimi- zation for sequencing problems: a case study [ C]// Proceedings of the 2004 Congress on Evolutionary Computation. Washington, DC: IEEE Computer Society, 2004:536-540.
  • 7XIA WEIJUN, WU ZHIMING, ZHANG WEI, et al. A new hybrid optimization algorithm for the job-shop scheduling problem [ C]// Proceedings of the 2004 American Control Conference. Washington,DC: IEEE Computer Society, 2004:5552 -5557.
  • 8JERALD J, ASOKAN P, PRABAHARAN G, et al. Scheduling op- timization of flexible manufacturing systems using particle swarm op- timization algorithm [ J]. International Journal of Advanced Manu- facturing Technology, 2005, 25(9/10): 964-971.
  • 9贾兆红,陈华平,孙耀晖.多目标粒子群优化算法在柔性车间调度中的应用[J].小型微型计算机系统,2008,29(5):885-889. 被引量:15
  • 10DAUZERE-PERES S, PAULLI J. An integrated approach for mod- eling and solving the general multiprocessor job-shop scheduling problem using tabu search [ J]. Annals of Operations Research, 1997, 70(3) : 281 - 30.

二级参考文献1

共引文献14

同被引文献96

引证文献8

二级引证文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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