期刊文献+

一种求解图着色问题的改进粒子群算法

An Improved Partice Swarm Optimization Algorithm for Graph Coloring Problem
在线阅读 下载PDF
导出
摘要 图着色问题是一个典型组合优化难题,文章尝试用改进的粒子群算法来解决此问题。为了增强粒子的搜索能力和提高粒子群算法的收敛速度,在传统的粒子群算法中引入了动态惯性权值递减的策略与记忆机制。实验表明,该算法在性能上明显优于传统的粒子群算法。
出处 《光盘技术》 2008年第9期33-34,共2页 CD TECHNOLOGY
关键词 图着色问题 粒子群算法 记忆机制 Graph coloring problem PSO Memory mechanism
  • 相关文献

参考文献5

二级参考文献22

  • 1金慧敏,马良.遗传退火进化算法在背包问题中的应用[J].上海理工大学学报,2004,26(6):561-564. 被引量:37
  • 2马慧民,柳毅,叶春明.基于改进粒子群算法求解单级多资源约束生产批量计划问题[J].工业工程与管理,2005,10(6):66-70. 被引量:26
  • 3EBERHARD R,KENNEDY J.A new optimizer using particle swarm theory [ A].Proceeding of sixth international symposium on micro machine and human science[C],NJ,USA:IEEE Service Center,1995,39-43.
  • 4KENNEDY J,EBERHARD R.Particle swarm optimization[A].Proceeding of IEEE Int' l Conference on Neural Networks[C],NJ,USA:IEEE Service Center,1995,1982-1948.
  • 5MA Hui-min,YE Chun-ming,ZHANG Shuang.Binary immune memory particle swarm optimization algorithm for the single level uncapacitated lot-sizing problem[A].The Proceedings of the 12th International Conference on Industrial Engineering and Engineering Management[ C],Beijing:China machine press,2006,602-605.
  • 6KENNEDY J,EBERHARD R.A discrete binary version of the particle swarm optimization [A].Proceeding of the conference on System,Man,and Cybernetics [ C ],NJ,USA:IEEE Service Center,1997,4104-4109.
  • 7FATIH M,LIANG Y.A binary particle swarm optimization algorithm for lot sizing problem[J].Journal of Economic and Social Research,2003,5 (2):1-20.
  • 8Appel K,Haken W. The solution of the four-color-map problem [J].Scientific American,197,Oct:108-121.
  • 9Colorni A,Dorigo M,Maniezzo V.An investigation of some properties of ant algorithm[C].Proc.of the Parallel Problem Solving from Nature Conference (PPSN'92).Belgium;Elsevier.
  • 10Colorni A, Dorigo M,Maniezo V.Colorni A,Ant system;optimization by a colony of cooperating agents[J].IEEE Trans On System,Man,and Cybernetis,1996,26(1):29-41.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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