Abstract
In differential evolution (DE), the salient feature lies in its mutationmechanismthat distinguishes it from other evolutionary algorithms. Generally, for most of the DE algorithms, the parents for mutation are randomly chosen from the current population. Hence, all vectors of population have the equal chance to be selected as parents without selective pressure at all. In this way, the information of population cannot be fully exploited to guide the search. To alleviate this drawback and improve the performance of DE, we present a new selection method of parents that attempts to choose individuals for mutation by utilizing the population information effectively. The proposed method is referred as fitnessand- position based selection (FPS), which combines the fitness and position information of population simultaneously for selecting parents in mutation of DE. In order to evaluate the effectiveness of FPS, FPS is applied to the original DE algorithms, as well as several DE variants, for numerical optimization. Experimental results on a suite of benchmark functions indicate that FPS is able to enhance the performance of most DE algorithms studied. Compared with other selection methods, FPS is also shown to be more effective to utilize information of population for guiding the search of DE.
Similar content being viewed by others
References
Storn R, Price K. Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 1997, 11(4): 341–359
Das S, Suganthan P N. Differential evolution: a survey of the state-ofthe-art. IEEE Transactions on Evolutionary Computation, 2011, 15(1): 4–31
Plagianakos V, Tasoulis D, Vrahatis M. A review of major application areas of differential evolution. Advances in Differential Evolution, 2008, 143: 197–238
Zhou Y, Wang J. A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows. IEEE Systems Journal, 2014, 99: 1–14
Wang J, Cai Y. Multiobjective evolutionary algorithm for frequency assignment problem in satellite communications. Soft Computing, 2015, 19(5): 1229–1253
Neri F, Tirronen V. Recent advances in differential evolution: a survey and experimental analysis. Artificial Intelligence Review, 2010, 33(1/2): 61–106
Qin A, Huang V, Suganthan PN. Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Transactions on Evolutaionry Computation, 2009, 13(2): 398–417
Brest J, Greiner S, Boskovíc B, Mernik M, Zumer V. Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Transactions on Evolutionary Computation, 2006, 10(6): 646–657
Yu W, Shen M, Chen W, Zhan Z, Gong Y, Lin Y, Liu O, Zhang J. Differential evolution with two-level parameter adaptation. IEEE Transactions on Cybernetics, 2014, 44(7): 2168–2267
Tang L, Dong Y, Liu J. Differential evolution with an individualdependent mechanism. IEEE Transactions on Evolutionary Computation, 2014, 99
Zhang J, Sanderson A. JADE: adaptive differential evolution with optional external archive. IEEE Transactions on Evolutionary Computation, 2009, 13(5): 945–958
Cai Y, Wang J. Differential evolution with neighborhood and direction information for numerical optimization. IEEE Transactions on Cybernetics, 2013, 43 (6): 2202–2215
Das S, Abraham A, Chakraborty U K, Konar K. Differential evolution using a neighborhood-based mutation operator. IEEE Transactions on Evolutionary Computation, 2009, 13(3): 526–553
Wang J, Liao J, Zhou Y, Cai Y. Differential evolution enhanced with multiobjective sorting based mutation operators. IEEE Transactions on Cybernetics, 2014, 46(12): 2792–2805
Wang Y, Cai Z, Zhang Q. Differential evolution with composite trial vector generation strategies and control parameters. IEEE Transactions on Evolutionary Computation, 2011, 15(1): 55–66
Sun J, Zhang Q, Tsang EPK. DE/EDA: a new evolutionary algorithm for global optimization. Information Sciences, 2005, 169(3): 249–262
Xin B, Chen J, Zhang J, Fang H, Peng Z. Hybridizing differential evolution and particle swarm optimization to design powerful optimizers: a review and taxonomy. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2012, 42(5): 744–767
Li Y, Zhan Z, Gong Y, Chen W, Zhang J, Li Y. Differential evolution with an evolution path: a deep evolutionary algorithm. IEEE Transactions on Cybernetics, 2014, 99
Dorronsoro B, Bouvry P. Improving classical and decentralized differential evolution with new mutation operator and population topologies. IEEE Transactions on Evolutionary Computation, 2011, 15(1): 67–98
Weber M, Tirronen V, Neri F. Scale factor inheritance mechanism in distributed differential evolution. Soft Computing, 2010, 14(11): 1187–1207
Noman N, Iba H. Accelerating differential evolution using an adaptive local search. IEEE Transactions on Evolutionary Computation, 2008, 12(1): 107–125
Epitropakis MG, Tasoulis DK, Pavlidis NG, Plagianakos PV, Vrahatis MN. Enhancing differential evolution utilizing proximity based mutation operators. IEEE Transactions on Evolutioanry Computation, 2011, 15(1): 99–119
Gong W, Cai Z. Differential evolution with ranking-based mutation operators. IEEE Transactions on Cybernetics, 2013, 43(6): 2066–2081
Wang H, Rahnamayan S, Hui S, Omran MG. Gaussian barebones differential evolution. IEEE Transactions on Cybernetics, 2013, 43(2): 634–647
Cai Y, Wang J, Chen Y, Tian W, Hui T. Adaptive direction information in differential evolution for numerical optimization. Soft Computing, 2014
Mallipeddi R, Suganthan P N, Pan Q, Tasgetiren M. Differential evolution algorithm with ensemble of parameters and mutation strategies. Applied Soft Computing, 2011, 11(2): 1679–1696
Gong W, Cai Z, Ling CX, Li H. Enhanced differential evolution with adaptive strategies for numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2011, 41(2): 397–413
García-Martínez C, Rodríguez F, Lozano M. Role differentiation and malleable mating for differential evolution: an analysis on large-scale optimization. Soft Computing, 2011, 15(11): 2109–2126
Chen G, Low C, Yang Z. Preserving and exploiting genetic diversity in evolutionary programming algorithms. IEEE Transactions on Evolutionary Computation, 2009, 13(3): 661–673
Cai Y, Wang J, Yin J. Learning-enhanced differential evolution for numerical optimization. Soft Computing, 2012, 16(2): 303–330
Baeck T, Fogel D B, Michalewicz Z. Handbook of evolutionary computation. New York: Taylor & Francis, 1997
Suganthan P N, Hansen N, Liang J, Deb K, Chen Y, Auger A, Tiwari S. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Report Number 2005005. 2005
Rahnamayan S, Tizhoosh H R, Salama M M A. Opposition based differential evolution. IEEE Transactions on Evolutionary Computation, 2008, 12(1): 64–79
Wilcoxon F. Individual comparisons by ranking methods. Biometrics, 1945, 1(6): 80–83
García S, Fernández A, Luengo J, Herrera F. A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Computing, 2009, 13(10): 959–977
Derrac J, García S, Molina D, Herrera F. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 2011, 1(1): 3–18
Alcalá-Fdez J, S′ánchez L, García S. KEEL: A software tool to assess evolutionary algorithms to data mining problems. Soft Computing, 2009, 13(3): 307–318
Das S, Suganthan P N. Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Technical Report. 2010
Chow C K, Yuen S Y. An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Transactions on Evolutionary Computation, 2011, 15(6): 741–769
Zhou X, Wu Z, Wang H, Rahnamayan S. Enhancing differential evolution with role assignment scheme. Soft Computing, 2013, 18(11): 2209–2225
Guo WZ, Liu G G, Chen G L, Peng S J. A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning. Frontiers of Computer Science, 2014, 8(2): 203–216
Zhang Y, Gong D W. Generating test data for both paths coverage and faults detection using genetic algorithms: multi-path case. Frontiers of Computer Science, 2014, 8(5): 726–740
Author information
Authors and Affiliations
Corresponding author
Additional information
Yiqiao Cai is currently a lecturer with the College of Computer Science and Technology at Huaqiao University, China. He received his BS from Hunan University, China in 2007 and PhD from Sun Yat-sen University, China in 2012. His research interests are differential evolution, multiobjective optimization, and other evolutionary computation techniques.
Yonghong Chen is now a professor of College of Computer Science and Technology at Huaqiao University, China. He received his BS from Hubei National University, China, his ME and PhD from Chongqing University, China in 2000 and 2005, respectively. His research interests include network security, watermarking and nonlinear processing.
Tian Wang is currently a lecturer with the College of Computer Science and Technology at Huaqiao University, China. He received his BS and MS in computer science from the Central South University, China in 2004 and 2007, respectively, and PhD in computer science from the City University of Hong Kong, China in 2011. His research interests include wireless networks, Internet of Things, and mobile computing.
Hui Tian is now an associate professor of College of Computer Science and Technology at Huaqiao University, China. He received his BS and MS in 2004 and 2007 fromWuhan Institute of Technology, China, and PhD in 2010 from Huazhong University of Science and Technology, China. His present research interests include network and multimedia information security, digital forensics, and information hiding.
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Cai, Y., Chen, Y., Wang, T. et al. Improving differential evolution with a new selection method of parents for mutation. Front. Comput. Sci. 10, 246–269 (2016). https://doi.org/10.1007/s11704-015-4480-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-015-4480-8