期刊文献+

基于改进花朵授粉算法的智能系统 被引量:1

Intelligent System Research Based on Modified Flower Pollination Algorithm
下载PDF
导出
摘要 智能系统试图模拟人类专家来解决复杂的现实问题。问题的领域从工程、工业到医学、教育都各不相同。在大多数情况下,系统需要根据多个输入进行决策;但是搜索空间通常很大,因此很难使用传统的算法进行决策。元启发式算法可以用作寻找最优解的一种工具。因此,改进元启发式技术和现有算法是必要的。介绍了一种改进的花朵授粉算法(FPA)。将标准的FPA与克隆选择算法(CSA)结合,应用到23个优化基准函数上;并对其进行测试。将改进算法与五种著名的优化算法(模拟退火、遗传算法、花授粉算法、蝙蝠算法和萤火虫算法)进行比较。实验结果表明,相比标准FPA和其他四种方法,改进花朵授粉算法能够找到更精确的解。 Intelligent systems try to solve complex real-world problems like experts.The problems are different from different areas.In most situations,the system is required to take decisions based on multiple inputs,but the search space is usually very huge so that it will be very hard to use the traditional algorithms to take a decision;at this point,the metaheuristic algorithms can be used as an alternative tool to find near-optimal solutions.Thus,inventing new metaheuristic techniques and enhancing the current algorithms is necessary.An enhanced variant of the flower pollination algorithm(FPA)was introduced.The standard FPA with the clonal selection algorithm(CSA)was hybridized and tested the new algorithm by applying it to 23 optimization benchmark problems.The proposed algorithm is compared with five famous optimization algorithms,namely,simulated annealing,genetic algorithm,flower pollination algorithm,bat algorithm,and firefly algorithm.The results show that the proposed algorithm is able to find more accurate solutions than the standard FPA and the other four techniques.The superiority of the proposed algorithm nominates it for being a part of intelligent and expert systems.
作者 杨孝敬 焦清局 王乙婷 YANG Xiao-jing;JIAO Qing-ju;WANG Yi-ting(College of Computer and Information Engineering,Anyang Normal University,Anyang 455000,China;International WIC Institute,Beijing University of Technology,Beijing 100124,China;School of Electronic Information and Electrical Engineering,Shanghai Jiaotong University,Shanghai 200240,China)
出处 《科学技术与工程》 北大核心 2018年第19期72-83,共12页 Science Technology and Engineering
基金 国家自然科学基金(61040010) 国家语委科研规划项目(YB135-50)资助
关键词 自然启发算法 克隆选择算法 花朵授粉算法 全局优化 nature-inspired algorithms clonal selection algorithm flower pollination algorithm global optimization
  • 相关文献

参考文献2

二级参考文献14

  • 1李强.创建决策树算法的比较研究——ID3,C4.5,C5.0算法的比较[J].甘肃科学学报,2006,18(4):84-87. 被引量:51
  • 2Kennedy J, Eberhart R C. Particle swarm optimization. In: proceed- ings of IEEE International Conference on Neural Networks, Piscat- away, NJ : IEEEPress, 1995 : 1942-1948.
  • 3Eberhart R C, Kennedy J. A new optimizer using particle swarm the- ory. In : Proc of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995:39-'43.
  • 4Karaboga. D. An idea based on honey bee swarm for numerical opti- mization. Technical Report-TR06, Kayseri: Erciyes University, En- gine-ering Faculty, Computer Engineering Departm-ent,2005.
  • 5Karaboga D, Basturk B. A powerful and efficient algorithmfor numer- ical function optimization: artificial bee colony (ABC) algo- rith Journal of Global Optimization ,2007 ;39 ( 3 ) :459--471.
  • 6Karaboga D, Basturk B. Artificial bee colony (ABC) optimization al- gorithm for solving constrained optimization. Foundations of Fuzzy Logic and Soft Computing, 2007 ;4529:789-798.
  • 7Karaboga D, Basturk B. On the performance of artificial bee colony ( ABC ) algorithm. Applied Soft Computing, 2008 ;8 ( 1 ) :687--697.
  • 8Karaboga D, Akay B. Artificial bee colony algorithm on training arti- ficial neural networks. //2007 IEEE 15th Signal Processing and Communications Applications Conference. New York : IEEE, 2007 : 818-821.
  • 9Karaboga D, Akey B, Ozturk C. Artificial bee colony(ABC) optimi- zation algorithm for training feed-forward neural networks. Modeling Decis-ions for Artificial Intelligence. Berlin: Springer-Verlag, 2007; 4617:318-319.
  • 10Karaboga N. A new design method based on artificial bee colony algo- rithm for digital IIR filters. Journal of the Franklin Institute,2009 ;346 (4) :328-348.

共引文献63

同被引文献9

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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