L-SHADE with competing strategies applied to constrained optimization

An enhanced version of L-SHADE algorithm has been proposed recently. The LSHADE44 algorithm uses three different additional strategies for computing a trial point and employed strategies compete in the algorithm. The algorithm was originally developed for bound-constrained optimization. In this paper, the LSHADE44 algorithm was slightly simplified and modified to be able to solve constrained problems. The benchmark set arranged for CEC2017 competition on constrained real-parameter optimization is employed.