Differential Evolution algorithm with Separated Groups for multi-dimensional optimization problems
The classical Differential Evolution (DE) algorithm, one of population-based Evolutionary Computation methods, proved to be a successful approach for relatively simple problems, but does not perform well for difficult multi-dimensional non-convex functions. A number of significant modifications of DE have been proposed in recent years, including very few approaches referring to the idea of distributed Evolutionary Algorithms. The present paper presents a new algorithm to improve optimization performance, namely DE with Separated Groups (DE-SG), which distributes population into small groups, defines rules of exchange of information and individuals between the groups and uses two different strategies to keep balance between exploration and exploitation capabilities. The performance of DE-SG is compared to that of eight algorithms belonging to the class of Evolutionary Strategies (Covariance Matrix Adaptation ES), Particle Swarm Optimization (Comprehensive Learning PSO and Efficient Population Utilization Strategy PSO), Differential Evolution (Distributed DE with explorative-exploitative population families, Self-adaptive DE, DE with global and local neighbours and Grouping Differential Evolution) and multi-algorithms (AMALGAM). The comparison is carried out for a set of 10-, 30- and 50-dimensional rotated test problems of varying difficulty, including 10- and 30-dimensional composition functions from CEC2005. Although slow for simple functions, the proposed DE-SG algorithm achieves a great success rate for more difficult 30- and 50-dimensional problems.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 216 (2012)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/eor|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kaelo, P. & Ali, M.M., 2006. "A numerical study of some modified differential evolution algorithms," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1176-1184, March.
- Mishra, SK, 2006. "Global Optimization by Differential Evolution and Particle Swarm Methods: Evaluation on Some Benchmark Functions," MPRA Paper 1005, University Library of Munich, Germany.
- Al-Anzi, Fawaz S. & Allahverdi, Ali, 2007. "A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times," European Journal of Operational Research, Elsevier, vol. 182(1), pages 80-94, October.
- Omran, Mahamed G.H. & Engelbrecht, Andries P. & Salman, Ayed, 2009. "Bare bones differential evolution," European Journal of Operational Research, Elsevier, vol. 196(1), pages 128-139, July.
- Beynon, Malcolm J. & Andrews, Rhys & Boyne, George A., 2010. "Evidence-based modelling of strategic fit: An introduction to RCaRBS," European Journal of Operational Research, Elsevier, vol. 207(2), pages 886-896, December.
- Zhang, Jingqiao & Avasarala, Viswanath & Subbu, Raj, 2010. "Evolutionary optimization of transition probability matrices for credit decision-making," European Journal of Operational Research, Elsevier, vol. 200(2), pages 557-567, January.
- Cruz, F.R.B. & van Woensel, T. & MacGregor Smith, J. & Lieckens, K., 2010. "On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks," European Journal of Operational Research, Elsevier, vol. 201(1), pages 183-193, February.
- Hedar, Abdel-Rahman & Fukushima, Masao, 2006. "Tabu Search directed by direct search methods for nonlinear global optimization," European Journal of Operational Research, Elsevier, vol. 170(2), pages 329-349, April.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:216:y:2012:i:1:p:33-46. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.