This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Performance of Differential Evolution and Particle Swarm Methods on Some Relatively Harder Multi-modal Benchmark Functions

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mishra, SK

Additional information is available for the following registered author(s):

Abstract

This paper aims at comparing the performance of the Differential Evolution (DE) and the Repulsive Particle Swarm (RPS) methods of global optimization. To this end, some relatively difficult test functions have been chosen. Among these test functions, some are new while others are well known in the literature. We use DE method with the exponential crossover scheme as well as with no crossover (only probabilistic replacement). Our findings suggest that DE (with the exponential crossover scheme) mostly fails to find the optimum in case of the functions under study. Of course, it succeeds in case of some functions (perm#2, zero-sum) for very small dimension, but begins to falter as soon as the dimension is increased. In case of DCS function, it works well up to dimension = 5. When we use no crossover (only probabilistic replacement) we obtain better results in case of several of the functions under study. In case of Perm#1, Perm#2, Zero-sum, Kowalik, Hougen and Power-sum functions, a remarkable advantage is there. Whether crossover or no crossover, DE falters when the optimand function has some element of randomness. This is indicated by the functions: Yao-Liu#7, Fletcher-Powell, and “New function#2”. DE has no problems in optimizing the “New function #1”. But the “New function #2” proves to be a hard nut. However, RPS performs much better for such stochastic functions. When the Fletcher-Powell function is optimized with non-stochastic c vector, DE works fine. But as soon as c is stochastic, it becomes unstable. Thus, it may be observed that an introduction of stochasticity into the decision variables (or simply added to the function as in Yao-Liu#7) interferes with the fundamentals of DE, which works through attainment of better and better (in the sense of Pareto improvement) population at each successive iteration. The paper concludes: (1) for different types of problems, different schemes of crossover (including none) may be suitable or unsuitable, (2) Stochasticity entering into the optimand function may make DE unstable, but RPS may function well.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://mpra.ub.uni-muenchen.de/449/
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 449.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 13 Oct 2006
Date of revision:
Handle: RePEc:pra:mprapa:449

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ekkehart Schlicht).

Related research
Keywords: Differential Evolution Repulsive Particle Swarm Global optimization non-convex functions Fortran computer program benchmark test Stochastic functions Fletcher-Powell Kowalik Hougen Power-sum Perm Zero-sum New functions Bukin function

Other versions of this item:

Find related papers by JEL classification:
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis

This paper has been announced in the following NEP Reports:

Cited by:
(explanations, 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.)
  1. Mishra, SK, 2007. "Minimization of Keane’s Bump Function by the Repulsive Particle Swarm and the Differential Evolution Methods," MPRA Paper 3098, University Library of Munich, Germany, revised 05 May 2007. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS was launched in September 1997.

This page was last updated on 2008-10-7.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.