A Novel Detection-and-Replacement-Based Order-Operator for Differential Evolution in Solving Complex Bound Constrained Optimization Problems
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.
Authors
- Ruihan Zhao (ORCID: https://orcid.org/0009-0009-8208-0377)
- Yifei Yang (ORCID: https://orcid.org/0000-0002-7790-9154)
- Sichen Tao (ORCID: https://orcid.org/0000-0001-9858-4208)
- Zheng Tang (ORCID: https://orcid.org/0000-0002-6543-7444)
- Sicheng Liu (ORCID: https://orcid.org/0000-0002-9147-9082)
- Shinichi Ohta
Institutions
- Tongji University (CN)
- Hirosaki University (JP)
- Chinese Academy of Sciences (CN)
- University of Toyama (JP)
- Technical University of Munich (DE)
Publication Details
- Journal
- Mathematics
- Published
- 2025-04-24
- DOI
- https://doi.org/10.3390/math13091389
- Citations
- 3
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 7.44
Funders
- Tongji University
- Hirosaki University
- Japan Society for the Promotion of Science
- Japan Science and Technology Agency