Range of search points in differential evolution and switching algorithm

Abstract

The differential evolution algorithm is an optimization algorithm that can easily obtain a good solution. An improvement from the viewpoint of interval estimation has been proposed, but the range of the search points and its variation in the search have not been reported in detail. In this research, we investigate about the range of the search points when applying the differential evolution algorithm to typical benchmark problems, and it is demonstrated that adjusting the parameter or changing the algorithm itself based on the range can be useful.