Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Journal of Global Optimization
Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization
Journal of Global Optimization
Evolutionary algorithms for constrained parameter optimization problems
Evolutionary Computation
Differential evolution with dynamic stochastic selection for constrained optimization
Information Sciences: an International Journal
Handling constraints in particle swarm optimization using a small population size
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
An analysis of the equilibrium of migration models for biogeography-based optimization
Information Sciences: an International Journal
Engineering Optimization: An Introduction with Metaheuristic Applications
Engineering Optimization: An Introduction with Metaheuristic Applications
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
Stochastic ranking for constrained evolutionary optimization
IEEE Transactions on Evolutionary Computation
Society and civilization: An optimization algorithm based on the simulation of social behavior
IEEE Transactions on Evolutionary Computation
Bat algorithm: literature review and applications
International Journal of Bio-Inspired Computation
Expert Systems with Applications: An International Journal
International Journal of Bio-Inspired Computation
International Journal of Bio-Inspired Computation
Neurocomputing
Hi-index | 0.09 |
The performance of an optimization tool is largely determined by the efficiency of the search algorithm used in the process. The fundamental nature of a search algorithm will essentially determine its search efficiency and thus the types of problems it can solve. Modern metaheuristic algorithms are generally more suitable for global optimization. This paper carries out extensive global optimization of unconstrained and constrained problems using the recently developed eagle strategy by Yang and Deb in combination with the efficient differential evolution. After a detailed formulation and explanation of its implementation, the proposed algorithm is first verified using twenty unconstrained optimization problems or benchmarks. For the validation against constrained problems, this algorithm is subsequently applied to thirteen classical benchmarks and three benchmark engineering problems reported in the engineering literature. The performance of the proposed algorithm is further compared with various, state-of-the-art algorithms in the area. The optimal solutions obtained in this study are better than the best solutions obtained by the existing methods. The unique search features used in the proposed algorithm are analyzed, and their implications for future research are also discussed in detail.