IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i9p1389-d1641619.html
   My bibliography  Save this article

A Novel Detection-and-Replacement-Based Order-Operator for Differential Evolution in Solving Complex Bound Constrained Optimization Problems

Author

Listed:
  • Sichen Tao

    (Faculty of Engineering, University of Toyama, Toyama-shi 930-8555, Japan)

  • Sicheng Liu

    (Faculty of Engineering, Yantai Vocational College, Yantai 264670, China)

  • Shoya Ohta

    (Faculty of Science and Technology, Hirosaki University, Hirosaki 036-8560, Japan)

  • Ruihan Zhao

    (School of Engineering and Design, Technical University Munich, 85748 Garching, Germany
    School of Mechanical Engineering, Tongji University, Shanghai 200082, China)

  • Zheng Tang

    (Faculty of Engineering, University of Toyama, Toyama-shi 930-8555, Japan
    Institute of AI for Industries, Chinese Academy of Sciences, 168 Tianquan Road, Nanjing 211135, China)

  • Yifei Yang

    (Faculty of Science and Technology, Hirosaki University, Hirosaki 036-8560, Japan)

Abstract

The design of differential evolution (DE) operators has long been a key topic in the research of metaheuristic algorithms. This paper systematically reviews the functional differences between mechanism improvements and operator improvements in terms of exploration and exploitation capabilities, based on the general patterns of algorithm enhancements. It proposes a theoretical hypothesis: operator improvement is more directly associated with the enhancement of an algorithm’s exploitation capability. Accordingly, this paper designs a new differential operator, DE/current-to-pbest/order, based on the classic DE/current-to-pbest/1 operator. This new operator introduces a directional judgment mechanism and a replacement strategy based on individual fitness, ensuring that the differential vector consistently points toward better individuals. This enhancement improves the effectiveness of the search direction and significantly strengthens the algorithm’s ability to delve into high-quality solution regions. To verify the effectiveness and generality of the proposed operator, it is embedded into two mainstream evolutionary algorithm frameworks, JADE and LSHADE, to construct OJADE and OLSHADE. A systematic evaluation is conducted using two authoritative benchmark sets: CEC2017 and CEC2011. The CEC2017 set focuses on assessing the optimization capability of theoretical complex functions, covering problems of various dimensions and types; the CEC2011 set, on the other hand, targets multimodal and hybrid optimization challenges in real engineering contexts, featuring higher structural complexity and generalization requirements. On both benchmark sets, OLSHADE demonstrates outstanding solution quality, convergence efficiency, and result stability, showing particular advantages in high-dimensional complex problems, thus fully validating the effectiveness of the proposed operator in enhancing exploitation capability. In addition, the operator has a lightweight structure and is easy to integrate, with good portability and scalability. It can be embedded as a general-purpose module into more DE variants and EAs in the future, providing flexible support for further performance optimization in solving complex problems.

Suggested Citation

  • Sichen Tao & Sicheng Liu & Shoya Ohta & Ruihan Zhao & Zheng Tang & Yifei Yang, 2025. "A Novel Detection-and-Replacement-Based Order-Operator for Differential Evolution in Solving Complex Bound Constrained Optimization Problems," Mathematics, MDPI, vol. 13(9), pages 1-40, April.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:9:p:1389-:d:1641619
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/9/1389/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/9/1389/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:9:p:1389-:d:1641619. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.