Journal of Global Optimization
Population set-based global optimization algorithms: some modifications and numerical studies
Computers and Operations Research
Advances in Engineering Software
A Fuzzy Adaptive Differential Evolution Algorithm
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Designing a hierarchical fuzzy logic controller using the differential evolution approach
Applied Soft Computing
Simulated Annealing versus Metropolis for a TSP instance
Information Processing Letters
Path planning on a cuboid using genetic algorithms
Information Sciences: an International Journal
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
Computers and Industrial Engineering
Differential Evolution as a viable tool for satellite image registration
Applied Soft Computing
Differential evolution approach for optimal reactive power dispatch
Applied Soft Computing
Automatic image pixel clustering with an improved differential evolution
Applied Soft Computing
IEEE Transactions on Evolutionary Computation
Ockham's Razor in memetic computing: Three stage optimal memetic exploration
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Differential evolution (DE) is a simple and effective global optimization algorithm. It has been successfully applied to solve a wide range of real-world optimization problems. However, DE has shown some weaknesses, especially the long computational times because of its stochastic nature. This drawback sometimes limits its application to optimization problems. Therefore we propose the 2-Opt based DE (2-Opt DE) which is inspired by 2-Opt algorithms to accelerate DE. The novel mutation schemes of 2-Opt DE, DE/2-Opt/1 and DE/2-Opt/2 are substituted for mutation schemes of the original DE namely DE/rand/1 and DE/rand/2. We also provide a comparison of 2-Opt DE to DE. A comprehensive set of 19 benchmark functions is employed for experimental verification. The experimental results confirm that 2-Opt DE outperforms the original DE in terms of solution accuracy and convergence speed.