花授粉算法的研究及应用
发布时间：2019-03-12 14:08
【摘要】：植物花授粉算法是根据自然界中植物花朵授粉行为机理进行模拟而设计的一种新型启发式优化算法,算法的局部搜索和全局搜索过程分别模拟自花授粉和异花授粉行为,并通过随机扰动来均衡算法局部搜索和全局搜索过程的比重分配。该算法具有结构简单,鲁棒性强,搜索能力强,容易实现等特点。目前,植物花授粉算法已被成功地应用到求解各种复杂的优化问题中。但随着研究的深入,研究者发现花授粉算法存在着后期寻优精度不高,易陷入局部最优等不足,限制了算法的应用范围。本文针对目前植物花授粉算法所存在的不足之处进行了一些分析和改进,并将改进的算法应用于一些经典的优化问题中,目的在于进一步完善植物花授粉算法的理论基础,并拓展其应用范围。本文的主要工作包括以下2个方面:(1)采用复数编码的思想对植物花授粉算法的编码方案进行改进,增加了花粉个体种群的多样性,同时,扩展了算法的全局探测能力,避免算法过早地陷入局部最优,克服了后期寻优精度不高的缺点,使得花授粉算法的整体性能更优。(2)利用精英反向花授粉算法解决非线性方程问题,实验结果表明,利用精英反向花授粉算法解非线性方程组在提高算法精确度的同时,加快了算法的收敛速度,避免算法出现早熟现象,具有高度的稳定性。
[Abstract]:Plant flower pollination algorithm is a new heuristic optimization algorithm designed according to the mechanism of plant flower pollination behavior in nature. The local and global search processes of the algorithm simulate self-pollination and cross-pollination, respectively. Stochastic perturbation is used to equalize the proportion allocation of local search and global search process. The algorithm has the characteristics of simple structure, strong robustness, strong search ability and easy realization. At present, plant flower pollination algorithm has been successfully applied to solve various complex optimization problems. However, with the deepening of the research, researchers found that the anthesis pollination algorithm has some disadvantages, such as low precision in late stage optimization, easy to fall into local optimization and so on, which limits the application range of the algorithm. In this paper, we analyze and improve the shortcomings of the current plant flower pollination algorithm, and apply the improved algorithm to some classical optimization problems in order to further improve the theoretical basis of plant flower pollination algorithm. And expand its application range. The main work of this paper includes the following two aspects: (1) the idea of complex number coding is used to improve the coding scheme of plant flower pollination algorithm, which increases the diversity of individual pollen population, and extends the global detection ability of the algorithm. The algorithm can avoid falling into local optimization prematurely and overcome the disadvantage that the precision of late optimization is not high, which makes the whole performance of flower pollination algorithm better. (2) the elite reverse flowering pollination algorithm is used to solve the problem of nonlinear equation. The experimental results show that: The elite reverse pollination algorithm is used to solve the nonlinear equations, which not only improves the accuracy of the algorithm, but also accelerates the convergence speed of the algorithm, and avoids the precocity of the algorithm, so it has a high degree of stability.
【学位授予单位】：广西民族大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP18
本文编号：2438850
[Abstract]:Plant flower pollination algorithm is a new heuristic optimization algorithm designed according to the mechanism of plant flower pollination behavior in nature. The local and global search processes of the algorithm simulate self-pollination and cross-pollination, respectively. Stochastic perturbation is used to equalize the proportion allocation of local search and global search process. The algorithm has the characteristics of simple structure, strong robustness, strong search ability and easy realization. At present, plant flower pollination algorithm has been successfully applied to solve various complex optimization problems. However, with the deepening of the research, researchers found that the anthesis pollination algorithm has some disadvantages, such as low precision in late stage optimization, easy to fall into local optimization and so on, which limits the application range of the algorithm. In this paper, we analyze and improve the shortcomings of the current plant flower pollination algorithm, and apply the improved algorithm to some classical optimization problems in order to further improve the theoretical basis of plant flower pollination algorithm. And expand its application range. The main work of this paper includes the following two aspects: (1) the idea of complex number coding is used to improve the coding scheme of plant flower pollination algorithm, which increases the diversity of individual pollen population, and extends the global detection ability of the algorithm. The algorithm can avoid falling into local optimization prematurely and overcome the disadvantage that the precision of late optimization is not high, which makes the whole performance of flower pollination algorithm better. (2) the elite reverse flowering pollination algorithm is used to solve the problem of nonlinear equation. The experimental results show that: The elite reverse pollination algorithm is used to solve the nonlinear equations, which not only improves the accuracy of the algorithm, but also accelerates the convergence speed of the algorithm, and avoids the precocity of the algorithm, so it has a high degree of stability.
【学位授予单位】：广西民族大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP18
【参考文献】
相关期刊论文 前6条
1 肖辉辉;万常选;段艳明;钟青;;基于模拟退火的花朵授粉优化算法[J];计算机应用;2015年04期
2 李超燕;赖红辉;周建良;;基于极大熵和声搜索算法的非线性方程组求解[J];计算机工程;2011年20期
3 陈得宝;李淮江;李峥;;复数编码粒子群算法及在函数优化中的应用[J];计算机工程与应用;2009年10期
4 王冬冬;周永权;;人工鱼群算法在求解非线性方程组中的应用[J];计算机应用研究;2007年06期
5 王书亭;王战江;;粒子群优化算法求解非线性问题的应用研究[J];华中科技大学学报(自然科学版);2005年12期
6 郑朝晖,张焱,裘聿皇;一种基于复数编码的遗传算法[J];控制理论与应用;2003年01期
，本文编号：2438850
本文链接：https://www.wllwen.com/kejilunwen/zidonghuakongzhilunwen/2438850.html
