arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.00671cs.NEcs.AIcs.LGcs.PFmath.OC
收藏

Prasatul矩阵:一种分析进化优化算法的直接比较方法

Prasatul Matrix: A Direct Comparison Approach for Analyzing Evolutionary Optimization Algorithms

National Institute of Technology Silchar(西尔恰尔国家理工学院)

Anupam Biswas

摘要:

个体进化优化算法的性能主要是根据统计数据来衡量的,例如均值、中位数和标准差等,计算的最佳解决方案获得的算法的几个线索。为了比较两种算法的性能,比较这些统计量的值,而不是直接比较解决方案。这种比较缺乏对不同算法所得解的直接比较。例如,两个算法的最佳解(或最差解)的比较是不可能的。此外,算法的排名主要是在解决方案的质量方面,尽管算法的收敛性也是一个重要因素。本文提出了一种直接比较的方法来分析进化优化算法的性能。一个直接比较矩阵称为\emph{Prasatul Matrix}的准备,它帐户的直接比较结果的最佳解决方案获得了两个算法的特定数量的试验。基于Prasatul矩阵设计了五种不同的性能指标,以评估算法在最优性和解的可比性方面的性能。这些分数被用来开发一个分数驱动的方法,用于比较多个算法的性能,以及在解决方案的质量和收敛性分析的理由进行排名。提出的方法进行了分析与6个进化优化算法的25个基准函数。还进行了非参数统计分析,即Wilcoxon配对秩和检验,以验证所提出的直接比较方法的结果。

英文摘要:

The performance of individual evolutionary optimization algorithms is mostly measured in terms of statistics such as mean, median and standard deviation etc., computed over the best solutions obtained with few trails of the algorithm. To compare the performance of two algorithms, the values of these statistics are compared instead of comparing the solutions directly. This kind of comparison lacks direct comparison of solutions obtained with different algorithms. For instance, the comparison of best solutions (or worst solution) of two algorithms simply not possible. Moreover, ranking of algorithms is mostly done in terms of solution quality only, despite the fact that the convergence of algorithm is also an important factor. In this paper, a direct comparison approach is proposed to analyze the performance of evolutionary optimization algorithms. A direct comparison matrix called \emph{Prasatul Matrix} is prepared, which accounts direct comparison outcome of best solutions obtained with two algorithms for a specific number of trials. Five different performance measures are designed based on the prasatul matrix to evaluate the performance of algorithms in terms of Optimality and Comparability of solutions. These scores are utilized to develop a score-driven approach for comparing performance of multiple algorithms as well as for ranking both in the grounds of solution quality and convergence analysis. Proposed approach is analyzed with six evolutionary optimization algorithms on 25 benchmark functions. A non-parametric statistical analysis, namely Wilcoxon paired sum-rank test is also performed to verify the outcomes of proposed direct comparison approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑