Search

Differential evolutionary (DE) algorithm is one of the most frequently used evolutionary computation method for the solution of non-differentiable, complex and discontinuous real value numerical problems. The analytical structure of the mutation and crossover operators used by DE and the initial values of the parameters of the relevant operators affect the problem-solving ability of DE. Unfortunately, there is no analytical method for selecting and initializing the best artificial genetic operators that DE can use to solve a problem. Therefore, there is a need to develop new evolutionary search methods that are parameter-free and insensitive to the artificial genetic operators they use. In this paper, the Bernstein–Levy differential evolution (BDE) algorithm, which has a unique elitist-mutation operator and a Bernstein polynomials-based stochastic parameter-free crossover operator, is introduced. The numerical problem-solving success of BDE is statistically evaluated by using 30 benchmark problems of CEC2014 in the numerical experiments presented. BDE's success in solving the related benchmark problems is statistically compared with six state-of-the-art comparison algorithms. In this paper, three real-world optimization problems are also solved by using the proposed algorithm, BDE. According to statistics generated from the experimental results, BDE is statistically better than comparison methods in solving the related real-world problems. [ABSTRACT FROM AUTHOR]

Camera calibration is an avoidable process for computationalvision applications, such as 3D reverse engineering, industrial robot calibration, optic-pattern recognition, simultaneous localization and mapping, autonomous visual-driving and photogrammetric vision. The camera calibration problem is too complex, nonlinear and multimodal. Traditional camera calibration methods using gradient-based optimization often trap to one of the many local solutions available. Accurate computation ability of traditional camera calibration methods is limited since they use gradient-based optimization methods. Since evolutionary computing algorithms can avoid local solutions of numerical problems, they have the potential to accurately compute the required camera calibration parameters for high-precision computationalvision applications. In this paper, the camera calibration parameters are computed by using 11 evolutionary computing algorithms, i.e., WDE, ABC, PSO, COBIDE, DE, CS, GWO, TLBO, MVMO, FOA and LSHADE. In order to make unbiased evaluation of the camera calibration results provided by the related evolutionary computing algorithms, two gradient-based traditional camera calibration methods, i.e., Zhang and Bouguet, have been used in the conducted experiments in this paper. The camera calibration results of the related methods were used to model a 3D physical test scene by using Structure from Motion photogrammetry method. The reference data set of the related 3D physical scene has been captured by using a 3D terrestrial laser scanner. Statistical comparison of the camera calibration results exposed that WDE supplies statistically better results than other comparison algorithms. [ABSTRACT FROM AUTHOR]

In this paper, weighted differential evolution algorithm (WDE) has been proposed for solving real-valued numerical optimization problems. When all parameters of WDE are determined randomly, in practice, WDE has no control parameter but the pattern size. WDE can solve unimodal, multimodal, separable, scalable, and hybrid problems. WDE has a very fast and quite simple structure, in addition, it can be parallelized due to its non-recursive nature. WDE has a strong exploration and exploitation capability. In this paper, WDE's success in solving CEC' 2013 problems was compared to 4 different EAs (i.e., CS, ABC, JADE, and BSA) statistically. One 3D geometric optimization problem (i.e., GPS network adjustment problem) and 4 constrained engineering design problems were used to examine the WDE's ability to solve real-world problems. Results obtained from the performed tests showed that, in general, problem-solving success of WDE is statistically better than the comparison algorithms that have been used in this paper. [ABSTRACT FROM AUTHOR]

In this paper, the algorithmic concepts of the Cuckoo-search (CK), Particle swarm optimization (PSO), Differential evolution (DE) and Artificial bee colony (ABC) algorithms have been analyzed. The numerical optimization problem solving successes of the mentioned algorithms have also been compared statistically by testing over 50 different benchmark functions. Empirical results reveal that the problem solving success of the CK algorithm is very close to the DE algorithm. The run-time complexity and the required function-evaluation number for acquiring global minimizer by the DE algorithm is generally smaller than the comparison algorithms. The performances of the CK and PSO algorithms are statistically closer to the performance of the DE algorithm than the ABC algorithm. The CK and DE algorithms supply more robust and precise results than the PSO and ABC algorithms. [ABSTRACT FROM AUTHOR]