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! ]

Global Optimization by Particle Swarm Method:A Fortran Program

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

Programs that work very well in optimizing convex functions very often perform poorly when the problem has multiple local minima or maxima. They are often caught or trapped in the local minima/maxima. Several methods have been developed to escape from being caught in such local optima. The Particle Swarm Method of global optimization is one of such methods. A swarm of birds or insects or a school of fish searches for food, protection, etc. in a very typical manner. If one of the members of the swarm sees a desirable path to go, the rest of the swarm will follow quickly. Every member of the swarm searches for the best in its locality - learns from its own experience. Additionally, each member learns from the others, typically from the best performer among them. Even human beings show a tendency to learn from their own experience, their immediate neighbours and the ideal performers. The Particle Swarm method of optimization mimics this behaviour. Every individual of the swarm is considered as a particle in a multidimensional space that has a position and a velocity. These particles fly through hyperspace and remember the best position that they have seen. Members of a swarm communicate good positions to each other and adjust their own position and velocity based on these good positions. The Particle Swarm method of optimization testifies the success of bounded rationality and decentralized decisionmaking in reaching at the global optima. It has been used successfully to optimize extremely difficult multimodal functions. Here we give a FORTRAN program to find the global optimum by the Repulsive Particle Swarm method. The program has been tested on over 90 benchmark functions of varied dimensions, complexities and difficulty levels.

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/874/
File Format:
File Function:
Download Restriction: no

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

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

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: Bounded rationality Decentralized decision making Jacobian Elliptic functions Gielis super-formula supershapes Repulsive Particle Swarm method of Global optimization nonlinear programming multiple sub-optimum global local optima fit data empirical estimation parameters curve fitting

Other versions of this item:

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

This paper has been announced in the following NEP Reports:

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.:
  1. Mishra, SK, 2006. "Some Experiments on Fitting of Gielis Curves by Simulated Annealing and Particle Swarm Methods of Global Optimization," MPRA Paper 465, University Library of Munich, Germany. [Downloadable!]
Full references

Statistics
Access and download statistics

Did you know? All top Economics journals are listed on RePEc.

This page was last updated on 2008-11-18.


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.