BMR 与 BWR:两种用于求解现实非凸约束与无约束问题的简单无隐喻优化算法
BMR and BWR: Two simple metaphor-free optimization algorithms for solving real-life non-convex constrained and unconstrained problems
AI总结:
本文提出无隐喻、无算法特定参数的 BMR 与 BWR 优化算法,并通过 CEC 2020、工程问题及标准基准验证其优越竞争力。
摘要:
本文开发并提出了两种简单而强大的优化算法,分别名为 Best-Mean-Random(BMR)和 Best-Worst-Random(BWR)算法,用于处理约束和无约束优化问题。这些算法不包含隐喻,也没有算法特定参数。BMR 算法基于为求解给定问题而生成的种群中的最优、平均和随机解,BWR 算法则基于最优、最差和随机解。通过在 2020 年进化计算大会(CEC)竞赛给出的 26 个现实非凸约束优化问题上实施所提出的两种算法,研究了其性能,并与其他著名优化算法的性能进行了比较。文中还研究了它们在 12 个约束工程问题上的性能,并将结果与近期算法的结果进行比较(在某些情况下,与 30 多种算法比较)。此外,还在 30 个无约束标准基准优化问题上进行了计算实验,其中包括 5 个近期开发且具有不同特征的基准问题。结果证明了所提出的简单算法具有卓越的竞争力和优越性。优化研究界可通过调整这些算法,在各科学与工程学科中求解各类约束和无约束现实优化问题而获益。BMR 和 BWR 算法的代码可在 https://sites.google.com/view/bmr-bwr-optimization-algorithm/home?authuser=0 获取。
英文摘要:
Two simple yet powerful optimization algorithms, named the Best-Mean-Random (BMR) and Best-Worst-Random (BWR) algorithms, are developed and presented in this paper to handle both constrained and unconstrained optimization problems. These algorithms are free of metaphors and algorithm-specific parameters. The BMR algorithm is based on the best, mean, and random solutions of the population generated for solving a given problem, and the BWR algorithm is based on the best, worst, and random solutions. The performances of the proposed two algorithms are investigated by implementing them on 26 real-life nonconvex constrained optimization problems given in the Congress on Evolutionary Computation (CEC) 2020 competition, and comparisons are made with those of the other prominent optimization algorithms. The performances on 12 constrained engineering problems are also investigated, and the results are compared with those of very recent algorithms (in some cases, compared with more than 30 algorithms). Furthermore, computational experiments are conducted on 30 unconstrained standard benchmark optimization problems, including 5 recently developed benchmark problems with distinct characteristics. The results demonstrated the superior competitiveness and superiority of the proposed simple algorithms. The optimization research community may gain an advantage by adapting these algorithms to solve various constrained and unconstrained real-life optimization problems across various scientific and engineering disciplines. The codes of the BMR and BWR algorithms are available at https://sites.google.com/view/bmr-bwr-optimization-algorithm/home?authuser=0.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。