IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v15y2024i1p1-22.html
   My bibliography  Save this article

Paradox-Free Data Analysis in Numerical Comparisons of Optimization Algorithms: A Review and Case Study

Author

Listed:
  • Yunchao Zhi

    (Dongguan University of Technology, Dongguan, China)

  • Qunfeng Liu

    (Dongguan University of Technology, Dongguan, China)

  • Yuan Yan

    (University of Electronic Science and Technology of China, Shenzhen, China)

  • Yunpeng Jing

    (Dongguan University of Technology, Dongguan, China)

Abstract

Numerical comparison is essential for evaluating an optimization algorithm. Unfortunately, recent research has shown that two paradoxes may occur, namely the cycle ranking paradox and survival of the nonfittest paradox. Further exploitation reveals that these paradoxes stem from the method of data analysis, especially its comparison strategy. Therefore, the design and widespread use of paradox-free data analysis methods has become urgent. This paper is dedicated to reviewing the recent progress in paradox in numerical comparisons of optimization algorithms, especially the reasons for paradoxes and the ways to eliminate them. Specifically, significant progress has been made in eliminating paradoxes from two popular data analysis methods, including hypothesis testing and methods based on the cumulative distribution function. Furthermore, in this paper the authors provide case studies, aiming to show that paradoxes are common and how to eliminate them with paradox-free data analysis methods.

Suggested Citation

  • Yunchao Zhi & Qunfeng Liu & Yuan Yan & Yunpeng Jing, 2024. "Paradox-Free Data Analysis in Numerical Comparisons of Optimization Algorithms: A Review and Case Study," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 15(1), pages 1-22, January.
    • Handle: RePEc:igg:jsir00:v:15:y:2024:i:1:p:1-22
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.356514
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsir00:v:15:y:2024:i:1:p:1-22. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.