Highlights'/> A new hybrid algorithm for continuous optimization problem
首页> 外文期刊>Applied Mathematical Modelling >A new hybrid algorithm for continuous optimization problem
【24h】

A new hybrid algorithm for continuous optimization problem

机译:求解连续优化问题的新混合算法

获取原文
获取原文并翻译 | 示例
       

摘要

HighlightsAn efficient hybrid method based on the GA, PSO and SOS algorithms.The proposed method improves the natural selection process in GA by using the PSO and SOS.The experiment based on the data clustering and benchmark function shows the better performance of the proposed method.AbstractThis paper applies a new hybrid method by a combination of three population base algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Symbiotic Organisms Search (SOS). The proposed method has been inspired from natural selection process and it completes this process in GA by using the PSO and SOS. It tends to minimize the execution time and in addition to reduce the complexity. Symbiotic organisms search is a robust and powerful metaheuristic algorithm which has attracted increasing attention in recent decades. There are three alternative phases in the proposed algorithm: GA, which develops and selects best population for the next phases, PSO, which gets experiences for each appropriate solution and updates them as well and SOS, which benefits from previous phases and performs symbiotic interaction update phases in the real-world population. The proposed algorithm was tested on the set of best known unimodal and multimodal benchmark functions in various dimensions. It has further been evaluated in, the experiment on the clustering of benchmark datasets. The obtained results from basic and non-parametric statistical tests confirmed that this hybrid method dominates in terms of convergence, execution time, success rate. It optimizes the high dimensional and complex functions Rosenbrock and Griewank up to10330accuracy in less than 3 s, out-performing other known algorithms. It had also applied clustering datasets with minimum intra-cluster distance and error rate.
机译: 突出显示 一种基于GA,PSO和SOS算法的高效混合方法。 所提出的方法通过使用PSO和SOS改进了遗传算法中的自然选择过程。 基于数据聚类和基准功能的实验表明,该方法具有更好的性能。 摘要 本文结合遗传算法(GA),粒子群优化(PSO)和共生生物搜索这三种人口基础算法,应用了一种新的混合方法(SOS)。该方法的灵感来自自然选择过程,并通过使用PSO和SOS在GA中完成了该过程。它趋于使执行时间最小化并且除了降低复杂度之外。共生生物搜索是一种强大而强大的元启发式算法,近几十年来已引起越来越多的关注。拟议算法中包含三个替代阶段:GA,为下一阶段开发和选择最佳种群; PSO,为每个合适的解决方案获取经验,并对其进行更新; SOS,从先前的阶段中受益并执行共生相互作用更新现实世界中的各个阶段。所提出的算法在各种维度上的一组最著名的单峰和多峰基准函数上进行了测试。在基准数据集聚类的实验中对其进行了进一步评估。从基本和非参数统计测试获得的结果证实,这种混合方法在收敛性,执行时间和成功率方面占主导地位。它优化了高维和复杂函数Rosenbrock和Griewank,直到 10 330 精度不到3 s,优于其他已知算法。它还应用了具有最小群集内距离和错误率的群集数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号