Abstract
Differential evolution (DE) and evolutionary programming (EP) are two major algorithms in evolutionary computation. They have been applied with success to many real-world numerical optimization problems. Neighborhood search (NS) is a main strategy underpinning EP.There have been analyses of different NS operators’ characteristics. Although DE might be similar to the evolutionary process in EP, it lacks the relevant concept of neighborhood search. In this chapter, DE with neighborhood search (NSDE) is proposed based on the generalization of NS strategy. The advantages of NS strategy in DE are analyzed theoretically. These analyses mainly focus on the change of search step size and population diversity after using neighborhood search. Experimental results have shown that DE with neighborhood search has significant advantages over other existing algorithms on a broad range of different benchmark functions. NSDE’s scalability is also evaluated on a number of benchmark problems, whose dimension ranges from 50 to 200.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Storn, K. Price (1997) Differential Evolution – A Simple and Efficient Heuristic Strategy for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11:341–359
R. Thomsen (2003) Flexible Ligand Docking using Differential Evolution. Proc. of the 2003 Congress on Evolutionary Computation, 4:2354–2361
A.K. Qin, P.N. Suganthan (2005) Self-adaptive Differential Evolution Algorithm for Numerical Optimization. Proc. of the 2005 Congress on Evolutionary Computation, 2:1785–1791
D. Zaharie (2002) Critical Values for the Control Parameters of Differential Evolution Algorithms. Proc. of Mendel 2002, 8th International Conference on Soft Computing, 62–67
R. Gämperle, S. D. Müller, P. Koumoutsakos (2002) A Parameter Study for Differential Evolution. Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation, 293–298
X. Yao, Y. Liu, G. Lin (1999) Evolutionary Programming Made Faster. IEEE Transactions on Evolutionary Computation, 3:2:82–102
C. Lee, X. Yao (2004) Evolutionary Programming Using Mutations Based on the Lévy Probability Distribution. IEEE Transactions on Evolutionary Computation, 8:1:1–13
T. Bäck, H. P. Schwefel (1993) An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation, 1:1–23
J. Vesterstrom, R. Thomsen (2004) A Comparative Study of Differential Evolution, Particle Swarm Optimization, and Evolutionary Algorithms on Numerical Benchmark Problems. Evolutionary Computation, 2:1980–1987
Y. Liu, X. Yao, Q. Zhao, T. Higuchi (2001) Scaling Up Fast Evolutionary Programming with Cooperative Coevolution. Proc. of the 2001 Congress on Evolutionary Computation, 1:1101–1108
P. N. Suganthan et al. (2005) Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization. http://www.ntu.edu.sg/home/EPNSugan
J. Rönkkönen, S. Kukkonen, K. V. Price (2005) Real-Parameter Optimization with Differential Evolution. Proc. of the 2005 Congress on Evolutionary Computation, 1:567–574
A. Auger, S. Kern, N. Hansen (2005) Performance Evoluation of an Advanced Local Search Evolutionary Algorithm. Proc. of the 2005 Congress on Evolutionary Computation, 2:1777–1784
H. Nikolaus (2005) Compilation of Results on the 2005 CEC Benchmark Function Set. http://www.ntu.edu.sg/home/EPNSugan
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yang, Z., Yao, X., He, J. (2007). Making a Difference to Differential Evolution. In: Siarry, P., Michalewicz, Z. (eds) Advances in Metaheuristics for Hard Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72960-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-72960-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72959-4
Online ISBN: 978-3-540-72960-0
eBook Packages: Computer ScienceComputer Science (R0)