Adaptive Recombination Operator Selection in Push and Pull Search for Solving Constrained Single-Objective Optimization Problems

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes an adaptive method to select recombination operators, including differential evolution (DE) operators and polynomial operators. Moreover, a push and pull search (PPS) method is used to handle constrained single-objective optimization problems (CSOPs). The PPS has two search stages—the push stage and the pull stage. In the push stage, a CSOP is optimized without considering constraints. In the pull stage, the CSOP is optimized with an improved epsilon constraint-handling method. In this paper, twenty-eight CSOPs are used to test the performance of the proposed adaptive GA with the PPS method (AGA-PPS). AGA-PPS is compared with three other differential evolution algorithms, including LSHADE44+IDE, LSHADE44 and UDE. The experimental results indicate that the proposed AGA-PPS is significantly better than other compared algorithms on the twenty-eight CSOPsq.

Cite

CITATION STYLE

APA

Fan, Z., Wang, Z., Fang, Y., Li, W., Yuan, Y., & Bian, X. (2018). Adaptive Recombination Operator Selection in Push and Pull Search for Solving Constrained Single-Objective Optimization Problems. In Communications in Computer and Information Science (Vol. 951, pp. 355–367). Springer Verlag. https://doi.org/10.1007/978-981-13-2826-8_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free