<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.0.1" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Porting the Particle Swarm</title>
	<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131</link>
	<description>Data Analytics- the art and science of analyzing data</description>
	<pubDate>Sun, 06 Jul 2008 04:18:56 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.0.1</generator>

	<item>
		<title>by: John Aitchison</title>
		<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-991</link>
		<pubDate>Wed, 27 Feb 2008 08:24:53 +0000</pubDate>
		<guid>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-991</guid>
					<description>Thanks, I had a look at PGSL .. for those interested it is at
http://itc.scix.net/data/works/att/w78-2000-708.content.pdf
and
http://www.geocities.com/bennyraphael/PGSL/PGSL4.html (including a link to the C source)

Interestingly, it claims to work very well on problems involving large numbers of variables.</description>
		<content:encoded><![CDATA[<p>Thanks, I had a look at PGSL .. for those interested it is at<br />
<a href='http://itc.scix.net/data/works/att/w78-2000-708.content.pdf' rel='nofollow'>http://itc.scix.net/data/works/att/w78-2000-708.content.pdf</a><br />
and<br />
<a href='http://www.geocities.com/bennyraphael/PGSL/PGSL4.html' rel='nofollow'>http://www.geocities.com/bennyraphael/PGSL/PGSL4.html</a> (including a link to the C source)</p>
<p>Interestingly, it claims to work very well on problems involving large numbers of variables.
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: Sandro Saitta</title>
		<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-967</link>
		<pubDate>Mon, 25 Feb 2008 12:32:43 +0000</pubDate>
		<guid>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-967</guid>
					<description>Regarding global optimization, an interesting algorithm is the one developed by Raphael and Smith in 2003 in our lab: &lt;a&gt;PGSL (Probabilistic Global Search Lausanne)&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>Regarding global optimization, an interesting algorithm is the one developed by Raphael and Smith in 2003 in our lab: <a>PGSL (Probabilistic Global Search Lausanne)</a>
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: John Aitchison</title>
		<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-311</link>
		<pubDate>Fri, 28 Dec 2007 00:55:18 +0000</pubDate>
		<guid>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-311</guid>
					<description>For those interested in PSO (Particle Swarm Optimization) and DE (Differential Evolution), you might be interested in visiting this site

Experimental and Agent-Based Computational Economics
 http://www1.webng.com/economics/

Amongst other material there ..

1. Global Optimization by Differential Evolution and Particle Swarm Methods: Evaluation on Some Benchmark Functions


2. Construction of Composite Indices -Alternatives to the Indices Obtained by the Principal Components Analysis

3. Computing the Nearest Correlation Matrix from a given Invalid Correlation Matrix</description>
		<content:encoded><![CDATA[<p>For those interested in PSO (Particle Swarm Optimization) and DE (Differential Evolution), you might be interested in visiting this site</p>
<p>Experimental and Agent-Based Computational Economics<br />
 <a href='http://www1.webng.com/economics/' rel='nofollow'>http://www1.webng.com/economics/</a></p>
<p>Amongst other material there ..</p>
<p>1. Global Optimization by Differential Evolution and Particle Swarm Methods: Evaluation on Some Benchmark Functions</p>
<p>2. Construction of Composite Indices -Alternatives to the Indices Obtained by the Principal Components Analysis</p>
<p>3. Computing the Nearest Correlation Matrix from a given Invalid Correlation Matrix
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: John Aitchison</title>
		<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-307</link>
		<pubDate>Wed, 26 Dec 2007 21:38:28 +0000</pubDate>
		<guid>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-307</guid>
					<description>Fair enough. Please accept my apologies for any offense.

In my defense, let me say that there was no annoyance with the paper nor any attempt to &quot;diss&quot; the algorithm, and my post was directed at the unsatisfactory nature of porting as opposed to rewriting, and an element of frustration in having to wrestle with C.

The code that I was &quot;complaining about&quot; was actually the &quot;Standard PSO 2006&quot;
http://www.particleswarm.info/Standard_PSO_2006.c . As its function is to act as  a &quot;reference standard&quot;  for researchers, there is certainly a justification for coding it in C. 

http://www.particleswarm.info/ says

&lt;blockquote&gt;
Quite often some authors say they compare their PSO versions to the &quot;standard one&quot; ... which is never the same! So the idea is to define a real standard at least for one year, validated by some researchers of the field, in particular James Kennedy and Maurice Clerc
&lt;/blockquote&gt;

I did do some research for an appropriate Delphi version and only found one commercial product, and several papers that said that they had implemented the PSO algorithm in Delphi  (but no readily accessible code). A quick search for PSO in C# was unproductive. As you say there are matlab versions.

For others reading this post, there is a listing of some of the PSO software here.
http://www.particleswarm.info/Programs.html (note the .info TLD). 

Also the PSO homepage is at http://www.cis.syr.edu/~mohan/pso/http://www.cis.syr.edu/~mohan/pso/

If I get the Delphi version going, anyone who is interested can contact me for a copy - but be aware it will not look much like the &quot;standard&quot; , because of the nature of the languages.</description>
		<content:encoded><![CDATA[<p>Fair enough. Please accept my apologies for any offense.</p>
<p>In my defense, let me say that there was no annoyance with the paper nor any attempt to &#8220;diss&#8221; the algorithm, and my post was directed at the unsatisfactory nature of porting as opposed to rewriting, and an element of frustration in having to wrestle with C.</p>
<p>The code that I was &#8220;complaining about&#8221; was actually the &#8220;Standard PSO 2006&#8243;<br />
<a href='http://www.particleswarm.info/Standard_PSO_2006.c' rel='nofollow'>http://www.particleswarm.info/Standard_PSO_2006.c</a> . As its function is to act as  a &#8220;reference standard&#8221;  for researchers, there is certainly a justification for coding it in C. </p>
<p><a href='http://www.particleswarm.info/' rel='nofollow'>http://www.particleswarm.info/</a> says</p>
<blockquote><p>
Quite often some authors say they compare their PSO versions to the &#8220;standard one&#8221; &#8230; which is never the same! So the idea is to define a real standard at least for one year, validated by some researchers of the field, in particular James Kennedy and Maurice Clerc
</p></blockquote>
<p>I did do some research for an appropriate Delphi version and only found one commercial product, and several papers that said that they had implemented the PSO algorithm in Delphi  (but no readily accessible code). A quick search for PSO in C# was unproductive. As you say there are matlab versions.</p>
<p>For others reading this post, there is a listing of some of the PSO software here.<br />
<a href='http://www.particleswarm.info/Programs.html' rel='nofollow'>http://www.particleswarm.info/Programs.html</a> (note the .info TLD). </p>
<p>Also the PSO homepage is at <a href='http://www.cis.syr.edu/~mohan/pso/http://www.cis.syr.edu/~mohan/pso/' rel='nofollow'>http://www.cis.syr.edu/~mohan/pso/http://www.cis.syr.edu/~mohan/pso/</a></p>
<p>If I get the Delphi version going, anyone who is interested can contact me for a copy - but be aware it will not look much like the &#8220;standard&#8221; , because of the nature of the languages.
</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: James Kennedy</title>
		<link>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-305</link>
		<pubDate>Wed, 26 Dec 2007 12:23:48 +0000</pubDate>
		<guid>http://dsanalytics.com/dsblog/porting-the-particle-swarm_131#comment-305</guid>
					<description>The code you are complaining about comes from the very first paper ever written on the topic, more than ten years ago. It has some historical value to researchers, in that it shows how far the field has progressed since those primitive times.  It was not posted on the Internet to provide source code to anyone.

There are plenty of people doing current research with particle swarms, coding it in every language from Python to C++ to Java to SAS and Matlab.  In a perfect OO world we could grab objects and connect them to our system and they would work; it is likely that you could find such objects on the Internet for particle swarms.  Your annoyance here though is unjustified.  The paper you linked to was one that introduced the research community to a new algorithm, within weeks of its discovery, and the algorithm has undergone important refinement and revision since then.  You should have spent a little effort to search for what you wanted, instead of complaining that the first thing you found didn't work for you.

Jim Kennedy</description>
		<content:encoded><![CDATA[<p>The code you are complaining about comes from the very first paper ever written on the topic, more than ten years ago. It has some historical value to researchers, in that it shows how far the field has progressed since those primitive times.  It was not posted on the Internet to provide source code to anyone.</p>
<p>There are plenty of people doing current research with particle swarms, coding it in every language from Python to C++ to Java to SAS and Matlab.  In a perfect OO world we could grab objects and connect them to our system and they would work; it is likely that you could find such objects on the Internet for particle swarms.  Your annoyance here though is unjustified.  The paper you linked to was one that introduced the research community to a new algorithm, within weeks of its discovery, and the algorithm has undergone important refinement and revision since then.  You should have spent a little effort to search for what you wanted, instead of complaining that the first thing you found didn&#8217;t work for you.</p>
<p>Jim Kennedy
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
