On the relationship of degree of separability with depth of evolution in decomposition for cooperative coevolution
Pages 4823 - 4830
Abstract
Problem decomposition determines how subcomponents are created that have a vital role in the performance of cooperative coevolution. Cooperative coevolution naturally appeals to fully separable problems that have low interaction amongst subcomponents. The interaction amongst subcomponents is defined by the degree of separability. Typically, in cooperative coevolution, each subcomponent is implemented as a sub-population that is evolved in a round-robin fashion for a specified depth of evolution. This paper examines the relationship between the depth of evolution and degree of separability for different types of global optimisation problems. The results show that the depth of evolution is an important attribute that affects the performance of cooperative coevolution and can be used to ascertain the nature of the problem in terms of the degree of separability.
References
[1]
K. Deb, Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, 2001, vol. 16.
[2]
D. E. Clark and D. R. Westhead, “Evolutionary algorithms in computer-aided molecular design”, Journal of Computer-Aided Molecular Design, vol. 10, no. 4, pp. 337–358, 1996. [Online]. Available: https://doi.org/10.1007/BF00124503
[3]
R. E. Bellman, Adaptive control processes: a guided tour. Princeton University Press, 1961.
[4]
I. Zelinka, “A survey on evolutionary algorithms dynamics and its complexity mutual relations, past, present and future”, Swarm and Evolutionary Computation, vol. 25, pp. 2 — 14, 2015, sI: {RAMONA}. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S22106502150004
[5]
M. Lozano, D. Molina, and F. Herrera, “Editorial scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems”, Soft Computing, vol. 15, no. 11, pp. 2085–2087, 2011.
[6]
M. Potter and K. De Jong, “A cooperative coevolutionary approach to function optimization”, in Parallel Problem Solving from Nature PPSN III, ser. Lecture Notes in Computer Science Y. Davidor, H.-P. Schwefel, and R. Mnner, Eds. Springer Berlin Heidelberg, 1994, vol. 866, pp. 249–257.
[7]
Z. Yang, K. Tang, and X. Yao, “Large scale evolutionary optimization using cooperative coevolution”, Inf. Sci., vol. 178, no. 15, pp. 2985–2999, 2008.
[8]
T. Ray and X. Yao, “A cooperative coevolutionary algorithm with correlation based adaptive variable partitioning”, in Proceedings of the Eleventh conference on Congress on Evolutionary Computation, ser. CEC'09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 983–989. [Online]. Available: http://portal.acm.org/citation.cfm?id=1689599.1689729
[9]
Z. Yang, K. Tang, and X. Yao, “Multilevel cooperative coevolution for large scale optimization”, in IEEE Congress on Evolutionary Computation, 2008, pp. 1663–1670.
[10]
R. Chandra, “Competition and collaboration in cooperative coevolution of Elman recurrent neural networks for time-series prediction”, Neural Networks and Learning Systems, IEEE Transactions on, vol. 26, pp. 3123–3136, 2015.
[11]
R. Chandra and M. Zhang, “Cooperative coevolution of Elman recurrent neural networks for chaotic time series prediction”, Neurocomputing, vol. 186, pp. 116–123, 2012.
[12]
R. Chandra, M. Frean, and M. Zhang, “On the issue of separability for problem decomposition in cooperative neuro-evolution”, Neurocomputing, vol. 87, pp. 33–40, 2012.
[13]
K. Tang, X. Li, N. Suganthan, P, Z. Yang, and T. Weise, “Benchmark functions for the cec'2010 special session and competition on large scale global optimization”, Nature Inspired Computation and Applications Laboratory, USTC, China, Tech. Rep., 2009. [Online]. Available: http://nical.ustc.edu.cn/cec10ss.php
[14]
R. Salomon, “Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. a survey of some theoretical and practical aspects of genetic algorithms”, Biosystems, vol. 39, no. 3, pp. 263–278, 1996.
[15]
M. N. Omidvar and X. Li, “Cooperative coevolutionary algorithms for large scale optimisation”, Technical report, The Royal Melbourne Institute of Technology (RMIT), Tech. Rep.
[16]
K. Tang, X. Yao, P. N. Suganthan, C. MacNish, Y. P. Chen, C. M. Chen and Z. Yang, “Benchmark functions for the CEC'2008 special session and competition on large scale global optimization”, Nature Inspired Computation and Applications Laboratory, USTC, China, Tech. Rep., 2007, http://nical.ustc.edu.cn/cec08ss.php.
[17]
K. Tang, X. Li, P. N. Suganthan, Z. Yang, and T. Weise, “Benchmark functions for the CEC'2010 special session and competition on large-scale global optimization”, Nature Inspired Computation and Applications Laboratory, USTC, China, Tech. Rep., 2009, http://nical.ustc.edu.cn/cec10ss.php.
[18]
X. Li, K. Tang, M. N. Omidvar, Z. Yang, and K. Qin, “Benchmark functions for the CEC'2013 special session and competition on large-scale global optimization”, RMIT University, Melbourne, Australia, Tech. Rep., 2013, http://goanna.cs.rmit.edu.au/xiaodong/cec13-lsgo.
[19]
T. Back and H.-P. Schwefel, “An overview of evolutionary algorithms for parameter optimization”, Evolutionary computation, vol. 1, no. 1, pp. 1–23, 1993.
[20]
M. Omidvar, X. Li, Y. Mei, and X. Yao, “Cooperative co-evolution with differential grouping for large scale optimization”, Evolutionary Computation, IEEE Transactions on, vol. 18, no. 3, pp. 378–393, June 2014.
[21]
J. Vesterstrom and R. Thomsen, “A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems”, in Evolutionary Computation, 2004. CEC2004. Congress on, vol. 2. IEEE, 2004, pp. 1980–1987.
[22]
K. Tang, X. Yao, P. Suganthan, C. MacNish, Y. Chen, C. Chen, and Z. Yang, “Benchmark functions for the cec2008 special session and competition on large scale global optimization. nature inspired computation and applications laboratory, ustc”, Applicat. Lab., Univ. Sci. Technol. China. Hefei. China. Tech. rep, 2007.
[23]
R. Chandra and K. Bali, “Competitive two-island cooperative coevolution for real parameter global optimisation”.
[24]
R. Chandra, “Competition and collaboration in cooperative coevolution of elman recurrent neural networks for time-series prediction”, 2015.
[25]
M. N. Omidvar, X. Li, Y. Mei, and X. Yao, “Cooperative co-evolution with differential grouping for large scale optimization”, Evolutionary Computation, IEEE Transactions on, vol. 18, no. 3, pp. 378–393, 2014.
[26]
K. Deb, A. Anand, and D. Joshi, “A computationally efficient evolutionary algorithm for real-parameter optimization”, Evol. Comput., vol. 10, no. 4, pp. 371–395, 2002.
[27]
D. Ortiz-Boyer, C. Hervas-Martfnez, and N. Garcfa-Pedrajas, “Cix12: A crossover operator for evolutionary algorithms based on population features”. J. Artif. Intell. Res.(JAIR). vol. 24. pp. 1–48, 2005.
[28]
S. Kok and C. Sandrock, “Locating and characterizing the stationary points of the extended rosenbrock function”, Evolutionary Computation, vol. 17, no. 3, pp. 437–453, 2009.
[29]
A. Griewank and P. L. Toint, “Partitioned variable metric updates for large structured optimization problems”, Nu-merische Mathematik, vol. 39, no. 1, pp. 119–137, 1982.
[30]
B. Colson and P. L. Toint, “Optimizing partially separable functions without derivatives”, Optimization methods and software, vol. 20, no. 4-5, pp. 493–508, 2005.
[31]
K. Tang, X. Yao, P. Suganthan, C. MacNish, Y. Chen, C. Chen, and Z. Yang, “Benchmark functions for the cec2008 special session and competition on large scale global optimization. nature inspired computation and applications laboratory, ustc”, Applicat. Lab., Univ. Sci. Technol. China, Hefei, China, Tech, rep, 2007.
[32]
X. Li, K. Tang, M. N. Omidvar, Z. Yang, K. Qin, and H. China, “Benchmark functions for the cec 2013 special session and competition on large-scale global optimization”, gene, vol. 7, p. 33, 2013.
[33]
F. Herrera, M. Lozano, and D. Molina, “Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems”, Last accessed: July, 2010.
[34]
“Smart bilo: Computational intelligence framework”, accessed: 02–12–2015. [Online]. Available: http://smartbilo.aicrg.softwarefoundationfiji.org
Index Terms
- On the relationship of degree of separability with depth of evolution in decomposition for cooperative coevolution
Index terms have been assigned to the content through auto-classification.
Recommendations
Differential Evolution with Clustering Cooperative Coevolution for High-Dimensional Problems
ISCC-C '13: Proceedings of the 2013 International Conference on Information Science and Cloud Computing CompanionRecently, evolutionary algorithms have been successful to solve many optimization problems. However, their performance will deteriorate when applied to complex high-dimensional problems. A clustering-cooperative coevolution scheme was introduced into DE ...
Differential evolution and non-separability: using selective pressure to focus search
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationRecent results show that the Differential Evolution algorithm has significant difficulty on functions that are not linearly separable. On such functions, the algorithm must rely primarily on its differential mutation procedure which, unlike its ...
Novelty-driven cooperative coevolution
Cooperative coevolutionary algorithms CCEAs rely on multiple coevolving populations for the evolution of solutions composed of coadapted components. CCEAs enable, for instance, the evolution of cooperative multiagent systems composed of heterogeneous ...
Comments
Information & Contributors
Information
Published In
5624 pages
Copyright © 2016.
Publisher
IEEE Press
Publication History
Published: 01 July 2016
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025