Abstract
This paper presents a novel algorithm based on generalized opposition-based learning (GOBL) to improve the performance of differential evolution (DE) to solve high-dimensional optimization problems efficiently. The proposed approach, namely GODE, employs similar schemes of opposition-based DE (ODE) for opposition-based population initialization and generation jumping with GOBL. Experiments are conducted to verify the performance of GODE on 19 high-dimensional problems with D = 50, 100, 200, 500, 1,000. The results confirm that GODE outperforms classical DE, real-coded CHC (crossgenerational elitist selection, heterogeneous recombination, and cataclysmic mutation) and G-CMA-ES (restart covariant matrix evolutionary strategy) on the majority of test problems.



Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In: Proceedings of IEEE congress on evolutionary computation, pp 1769–1776
Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Publisher, New York
Brest J, Zamuda A, Bošković B, Maučec MS, Žumer V (2008) High-dimensional real-parameter optimization using self-adaptive differential evolution algorithm with population size reduction. In: Proceedings of IEEE congress on evolutionary computation, pp 2032–2039
Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26:29–41
Duarte A, Marti R (2009) An adaptive memory procedure for continuous optimization. In: Proceedings of international conference on intelligent system design and applications, pp 1085–1089
Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithm and interval schemata. Found Genet Algorithms 2:187–202
García-Martínez C, Lozano M (2009) Continuous variable neighbourhood search algorithm based on evolutionary metaheuristic components: A scalability test. In: Proceedings of international conference on intelligent system design and applications, pp 1074–1079
García S, Fernández A, Luengo J (2009a) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput 13:959–977
García S, Molina D, Lozano M, Herrera F (2009b) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the CEC2005 special session on real parameter optimization. J Heuristics 15:617–644
García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180:2044–2064
Gardeux V, Chelouah R, Siarry P, Glover F (2009) Unidimensional search for solving continuous high-dimensional optimization problems. In: Proceedings of international conference on intelligent system design and applications, pp 1096–1101
Herrera F, Lozano M (2009) Workshop for evolutionary algorithms and other metaheuristics for continuous optimization problems—a scalability test, In: Proceedings of international conference on intelligent system design and applications, Pisa, Italy
Herrera F, Lozano M, Molina D (2010a) Components and parameters of DE, real-coded CHC, and G-CMAES. Technical report, University of Granada, Spain
Herrera F, Lozano M, Molina D (2010b) Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems, Technical report, University of Granada, Spain
Hsieh S, Sun T, Liu C, Tsai S (2008) Solving large scale global optimization using improved particle swarm optimizer. In: Proceedings of IEEE congress on evolutionary computation, pp 1777–1784
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
Kirkpatrick S, Gelatt CD, Vecchi PM (1983) Optimization by simulated annealing. Science 220:671–680
Larranaga P, Lozano JA (2001) Estimation of distribution algorithms—a new tool for evolutionary computation. Kluwer Academic Publishers, Boston
Luengo J, García S, Herrera F (2009) A study on the use of statistical tests for experimentation with neural networks: analysis of parametric test conditions and non-parametric tests. Expert Syst Appl 36:7798–7808
Molina D, Lozano M,Herrera F (2009) Memetic algorithm with local search chaining for continuous optimization problems: a scalability test. In: Proceedings of international conference on intelligent system design and applications, pp 1068–1073
Muelas S, LaTorre A and Peña J (2009) A memetic differential evolution algorithm for continuous optimization. In: Proceedings of international conference on intelligent system design and applications, pp 1080–1084
Rahnamayan S, Wang GG (2008) Solving large scale optimization problems by opposition-based differential evolution (ODE). Trans Comput 7(10):1792–1804
Rahnamayan S, Wang GG (2009) Toward effective initialization for large-scale search spaces. Trans Syst 8(3):355–367
Rahnamayan S, Tizhoosh HR, Salama MMA (2006a) Opposition-based differential evolution algorithms. In: Proceedings of IEEE congress on evolutionary computation, pp 2010–2017
Rahnamayan S, Tizhoosh HR, Salama MMA (2006b) Opposition-based differential evolution for optimization of noisy problems. In: Proceedings of IEEE congress on evolutionary computation, pp 1865–1872
Rahnamayan S, Tizhoosh HR, Salama MMA (2008a) Opposition versus randomness in soft computing techniques. Elsevier J Appl Soft Comput 8:906–918
Rahnamayan S, Tizhoosh HR, Salama MMA (2008b) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optimiz 11:341–359
Tang K, Yao X, Suganthan PN, Macnish C, Chen Y, Chen C, Yang Z (2007) Benchmark functions for the CEC’2008 special session and competition on high-dimensional real-parameter optimization. Technical Report, Nature Inspired Computation and Applications Laboratory, USTC, China
Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of international conference on computational intelligence for modeling control and automation, pp 695–701
Tseng L, Chen C (2008) Multiple trajectory search for large scale global optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 3057–3064
Vesterstrom J, Thomsen R (2004) A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Proceedings of IEEE congress on evolutionary computation, pp 1980–1987
Wang Y, Li B (2008) A restart univariate estimation of distribution algorithm sampling under mixed Gaussian and Lévy probability distribution. In: Proceedings of IEEE congress on evolutionary computation, pp 3918–3925
Wang H, Liu Y, Zeng SY, Li H, Li CH (2007) Opposition-based particle swarm algorithm with Cauchy mutation. In: Proceedings of IEEE congress on evolutionary computation, pp 4750–4756
Wang H, Wu ZJ, Liu Y, Wang J, Jiang DZ, Chen LL (2009a) Space transformation search: a new evolutionary technique. In: Proceedings of world summit on genetic and evolutionary computation, pp 537–544
Wang H, Wu ZJ, Rahnamayan S, Kang LS (2009b) A scalability test for accelerated DE using generalized opposition-based learning. In: Proceedings of international conference on intelligent system design and applications, pp 1090–1095
Yang Z, Tang K, Yao X (2008) Multilevel cooperative coevolution for large scale optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 1663–1670
Zhao S, Liang J, Suganthan PN, Tasgetiren MF (2008) Dynamic multi-swarm particle swarm optimizer with local search for large scale global optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 3846–3853
Acknowledgments
The authors would like to thank Dr. D. Molina for his suggestions in the implementation of DE. The authors also thank the editor and the anonymous reviewers for their detailed and constructive comments that helped us to increase the quality of this work. This work was supported by the National Natural Science Foundation of China (No.: 61070008), and the Jiangxi Province Science & Technology Pillar Program (No.: 2009BHB16400).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, H., Wu, Z. & Rahnamayan, S. Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems. Soft Comput 15, 2127–2140 (2011). https://doi.org/10.1007/s00500-010-0642-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-010-0642-7