Abstract
Differential evolution is a simple yet efficient heuristic originally designed for global optimization over continuous spaces that has been used in many research areas. The question how to improve its performance is still popular and during the years, many successful methods dealing with optimal setting or hybridization of the control parameters were proposed. In this paper, we propose a novel approach based on modeling of the differential evolution dynamics by complex networks. In each generation, the individuals are mapped to the nodes and the relationships between them are modeled by the edges of the graph. Thanks to this simple visualization, the interconnection between the differential evolution convergence speed and the weighted clustering coefficients has been revealed. As a consequence, we have focused on the parents selection in the mutation step where the individuals are not selected randomly as usual but on the basis of their weighted clustering coefficients. Our enhancement has been incorporated in the classical differential evolution, self-adaptive differential evolution (jDE) and differential evolution with composite trial vector generation strategies and control parameters. Finally, a set of well-known benchmark functions (including 21 functions) has been used to test and evaluate the performance of the proposed enhancement of the differential evolution. The experimental results and statistical analysis indicate that the enhanced algorithms perform better or at least comparable to their original versions and the analysis of the differential evolution dynamics with the aim of the complex network might be an effective tool to improve the differential evolution convergence in the future.
Similar content being viewed by others
References
Ashlock D, Smucker M, Walker J (1999) Graph based genetic algorithms. In: Evolutionary computation. IEEE, pp 1362–1368
Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci USA 101:3747–3752
Boccaletti S, Latorab V, Morenod Y, Chavezf M, Hwanga DU (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308
Brest J, Maučec MS (2008) Population size reduction for the differential evolution algorithm. Appl Intell 29(3):228–247
Brest J, Greiner S, Boskovic B, Mernik M, Zumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evolut Comput 10:646–657
Chakraborty UK, Das S, Konar A, (2006) Differential evolution with local neighborhood. In: IEEE congress on evolutionary computation, CEC 2006. IEEE, pp 2042–2049
Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. Evolut Comput IEEE Trans 15(1):4–31
Das S, Abraham A, Chakraborty U, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evolut Comput 13:526–553
Davendra D, Zelinka I, Metlicka M, Senkerik R, Pluhacek M (2014a) Complex network analysis of differential evolution algorithm applied to flowshop with no-wait problem. In: 2014 IEEE symposium on differential evolution (SDE). IEEE, pp 1–8
Davendra D, Zelinka I, Senkerik R, Pluhacek M (2014b) Complex network analysis of discrete self-organising migrating algorithm. In: Nostradamus 2014: prediction, modeling and analysis of complex systems, pp 161–174
dos Santos Coelho L, Ayala HVH, Mariani VC (2014) A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization. Appl Math Comput 234:452–459
Fan HY, Lampinen J (2003) A trigonometric mutation operation to differential evolution. J Glob Optim 27(1):105–129
Gämperle R, Müller SD, Koumoutsakos P (2002) A parameter study for differential evolution. Adv Intell Syst Fuzzy Syst Evolut Comput 10:293–298
Gong M, Cai Q, Chen X, Ma L (2014) Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans Evolut Comput 18:82–97
Holme P, Park SM, Kim BJ, Edling CR (2007) Korean university life in a network perspective: dynamics of a large affiliation network. Phys A: Stat Mech Appl 373:821–830. doi:10.1016/j.physa.2006.04.066
Iorio AW, Li X (2005) Solving rotated multi-objective optimization problems using differential evolution. In: AI 2004: advances in artificial intelligence. Springer, pp 861–872
Islam S, Das S, Ghosh S, Roy S, Suganthan P (2011) An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization. IEEE Trans Evolut Comput 42:482–500
Kalna G, Higham DJ (2006) Clustering coefficients for weighted networks. In: Adaptation in artificial and biological systems. Society for the Study of Artificial Intelligence and the Simulation of Behaviour, pp 45–51
Kim J, Wilhelm T (2008) What is a complex graph? Phys A: Stat Mech Appl 387:2637–2652
KovaFevi D, Mladenovi N, Bratislav Petrovi PM (2014) DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization. Comput Oper Res 52:157–169
Li Y, Liu J, Liu C (2014) A comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks. Soft Comput 18:329–348
Mabu S, Hirasawa K, Hu J (2007) A graph-based evolutionary algorithm: genetic network programming (GNP) and its extension using reinforcement learning. Evolut Comput 15:369–398
Mallipeddi R, Suganthan PN (2010) Differential evolution algorithm with ensemble of parameters and mutation and crossover strategies. In: Swarm, evolutionary, and memetic computing. Springer, pp 71–78
Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11(2):1679–1696
Mezura-Montes E, Velasquez-Rezes J (2006) A comparative study of differential evolution variants for global optimization. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, pp 485–492
Mlakar M, Petelin D, Tušar T, Filipič B (2015) GP-DEMO: differential evolution for multiobjective optimization based on Gaussian process models. Eur J Oper Res 243(2):347–361
Neri F, Tirronen V (2010) Recent advances in differential evolution: a survey and experimental analysis. Artif Intell Rev 33(1–2):61–106
Noman N, Iba H (2008) Accelerating differential evolution using an adaptive local search. Evolut Comput IEEE Trans 12(1):107–125
Onnela JP, Saramaki J, Kertesz J, Kaski K (2005) Intensity and coherence of motifs in weighted complex networks. Phys Rev E 71:065103. doi:10.1103/PhysRevE.71.065103
Price K, Storn RM, Lampinen JA (2006) Differential evolution: a practical approach to global optimization. Springer, Berlin, Heidelberg
Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimizations. In: Proceedings of the 2005 IEEE congress on evolutionary computation, vol 2, pp 1785–1791
Rahnamayan S, Tizhoosh HR, Salama M (2006) Opposition-based differential evolution algorithms. In: IEEE congress on evolutionary computation, CEC 2006. IEEE, pp 2010–2017
Ronkkonen J, Kukkonen S, Price KV (2005) Real-parameter optimization with differential evolution. Proceedings of IEEE CEC 1:506–513
Saramaki J, Kivela M, Onnela JP, Kaski K, Kertes J (2007) Generalizations of the clustering coefficient to weighted complex networks. Phys Rev E 75:027105. doi:10.1103/PhysRevE.75.027105
Soleimani-pouri M, Rezvanian A, Meybodi MR (2014) An ant based particle swarm optimization algorithm for maximum clique problem in social networks. Springer International Publishing, pp 295–304. doi:10.1007/978-3-319-05912-9_14
Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. In: ICSI, IEEE
Tirronen V, Neri F, Rossi T (2009) Enhancing differential evolution frameworks by scale factor local search-part i. In: IEEE congress on evolutionary computation, CEC’09. IEEE, pp 94–101
Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. Evolut Comput 15:55–66
Wu Q, Hao J-K (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242(3):693–709
Yang Z, Yao X, He J (2008) Making a difference to differential evolution. Springer, Berlin, Heidelberg, pp 397–414. doi:10.1007/978-3-540-72960-0_19
Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evolut Comput 3:82–102
Yi W, Gao L, Li X, Zhou Y (2015) A new differential evolution algorithm with a hybrid mutation operator and self-adapting control parameters for global optimization problems. Appl Intell 42(4):642–660
Zaharie D (2009) Influence of crossover on the behavior of differential evolution algorithms. Appl Soft Comput 9(3):1126–1138
Zelinka I, Davendra DD, Snasel V, Senkerik R, Jasek R (2010) Preliminary investigation on relations between complex networks and evolutionary algorithms dynamics. In: Computer information systems and industrial management applications (CISIM)
Zelinka I, Davendra DD, Chadli M, Senkerik R, Dao TT, Skanderova L (2013) Evolutionary dynamics as the structure of complex networks. In: Handbook of optimization. Springer, Berlin, Heidelberg, pp 215–243
Zhang B, Horvath S (2005) A general framework for weighted gene co-expression network analysis. Prod Inf Stat Appl Genet Mol Biol 4. doi:10.2202/1544-6115.1128
Zhenyu Y, Tang K, Yao X (2008) Self-adaptive differential evolution with neighborhood search. In: Evolutionary computation, 2008. CEC 2008. IEEE, pp 1110–1116. doi:10.1109/CEC.2008.4630935
Zhou Y, Li X, Gao L (2013) A differential evolution algorithm with intersect mutation operator. Appl Soft Comput 13:390–401
Acknowledgments
The following grant are acknowledged for the financial support provided for this research: Grant Agency of the Czech Republic—GACR P103/15/06700S, partially supported by Grant of SGS No. SP2015/142, VSB—Technical University of Ostrava.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no potential conflict of interest to this work.
Additional information
Communicated by V. Loia.
Appendix 1: Benchmark functions
Appendix 1: Benchmark functions
1.1 Sphere Model
1.2 Schwefel’s Problem 2.22
1.3 Schwefel’s Problem 1.2
1.4 Schwefel’s Problem 1.21
1.5 Generalized Rosenbrock’s Function
1.6 Step Function
1.7 Quartic Function i.e. Noise
1.8 Generalized Schwefel’s Problem 2.26
1.9 Generalized Rastrigin’s Function
1.10 Ackley’s Function
1.11 Generalized Griewangk Function
1.12 Generalized Penalized Functions
where
1.13 Shekel’s Foxholes Function
where
1.14 Kowalik’s Function
See Table 6.
1.15 Six-Hump Camel-Back Function
1.16 Branin Function
1.17 Goldstein–Price Function
1.18 Shekel’s Family
where \(m = 5\), 7, and 10 for \(f_{19}\), \(f_{20}\), \(f_{21}\). The function \(f_{19}(x)\) has 10, \(f_{20}(x)\) 7 and \(f_{21}(x)\) 10 local minima, \(x_{\text {local}\_\text {opt}}\approx 1/{c_i}\) for \(1 \le i \le m\). The coefficients are defined by Table 7.
Rights and permissions
About this article
Cite this article
Skanderova, L., Fabian, T. Differential evolution dynamics analysis by complex networks. Soft Comput 21, 1817–1831 (2017). https://doi.org/10.1007/s00500-015-1883-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1883-2