<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Parallelcoding.com &#187; Optimization</title>
	<atom:link href="http://www.parallelcoding.com/category/optimization/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.parallelcoding.com</link>
	<description></description>
	<lastBuildDate>Mon, 16 Aug 2010 11:55:45 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=</generator>
		<item>
		<title>INFORMS 2010 Railway Application Section Competition</title>
		<link>http://www.parallelcoding.com/2010/05/14/informs-2010-railway-application-section-competition/</link>
		<comments>http://www.parallelcoding.com/2010/05/14/informs-2010-railway-application-section-competition/#comments</comments>
		<pubDate>Fri, 14 May 2010 13:45:08 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Heuristics]]></category>
		<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=555</guid>
		<description><![CDATA[Check it out here]]></description>
			<content:encoded><![CDATA[<p>Check it out <a href="http://www.informs-ras.org/Problem.htm">here</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/05/14/informs-2010-railway-application-section-competition/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Metaheuristics for Continuous Optimization</title>
		<link>http://www.parallelcoding.com/2010/05/14/metaheuristics-for-continuous-optimization/</link>
		<comments>http://www.parallelcoding.com/2010/05/14/metaheuristics-for-continuous-optimization/#comments</comments>
		<pubDate>Fri, 14 May 2010 11:26:09 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Heuristics]]></category>
		<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=552</guid>
		<description><![CDATA[I was working with a colleague who shared a site with me: http://150.214.190.154/EAMHCO/. An excellent source of information, code, etc. with regards to metaheuristics]]></description>
			<content:encoded><![CDATA[<p>I was working with a colleague who shared a site with me: <a href="http://150.214.190.154/EAMHCO/">http://150.214.190.154/EAMHCO/</a>. An excellent source of information, code, etc. with regards to metaheuristics</p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/05/14/metaheuristics-for-continuous-optimization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Making Airports More Efficient</title>
		<link>http://www.parallelcoding.com/2010/05/14/making-airports-more-efficient/</link>
		<comments>http://www.parallelcoding.com/2010/05/14/making-airports-more-efficient/#comments</comments>
		<pubDate>Fri, 14 May 2010 11:20:48 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=549</guid>
		<description><![CDATA[I&#8217;ve been following this post and I think it&#8217;s a good suggestion to TSA and all airlines.Discrete event simulation (DES) is a superb technique and when applied properly as it can give some real insight into real world simulations. I actually spent some time working on a small simulation library during my MS degree called [...]]]></description>
			<content:encoded><![CDATA[<p>I&#8217;ve been following this post and I think it&#8217;s a good suggestion to TSA and all airlines.Discrete event simulation (DES) is a superb technique and when applied properly as it can give some real insight into real world simulations. I actually spent some time working on a small simulation library during my MS degree called SimLib and I must say it is a quite interesting topic all the way from technical and implementation details to application!</p>
<p>Efficiency is King!</p>
<ul>
<li><a href="http://www.thinkor.org/2010/04/security-screening-bottleneck-analysis.html">Security Screening: Bottleneck Analysis</a></li>
<li><a href="http://www.thinkor.org/2010/05/security-screening-discrete-event.html">Security Screening: Discrete Event Simulation with Arena</a></li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/05/14/making-airports-more-efficient/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Central Force Optimization</title>
		<link>http://www.parallelcoding.com/2010/03/03/central-force-optimization/</link>
		<comments>http://www.parallelcoding.com/2010/03/03/central-force-optimization/#comments</comments>
		<pubDate>Wed, 03 Mar 2010 14:32:52 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Central Force Optimization]]></category>
		<category><![CDATA[Optimization]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=528</guid>
		<description><![CDATA[Central Force Optimization (CFO) is a new and interesting optimization method that has been developed by Richard A. Formato. The most interesting aspect of CFO is that it is fully deterministic unlike PSO, GA, AIS, or any of the other PIS based techniques. The papers that he has produced on the topic can be found [...]]]></description>
			<content:encoded><![CDATA[<p>Central Force Optimization (CFO) is a new and interesting optimization method that has been developed by Richard A. Formato. The most interesting aspect of CFO is that it is fully deterministic unlike PSO, GA, AIS, or any of the other PIS based techniques.</p>
<p>The papers that he has produced on the topic can be found at:</p>
<ol>
<li><a href="http://arxiv.org/abs/0912.1394">Are Near Earth Objects the Key to Optimization Theory?</a></li>
<li><a href="http://www.google.com/url?sa=t&amp;source=web&amp;ct=res&amp;cd=1&amp;ved=0CAYQFjAA&amp;url=http%3A%2F%2Fsci2s.ugr.es%2Feamhco%2Fpdfs%2Fformato07PIER.pdf&amp;ei=sHGOS6qhNJHk8QakxtGHDQ&amp;usg=AFQjCNHnOCCtHFooTSLtyBtJrQcMCAaCtg&amp;sig2=s9I4f7tH3qDRoq8EB_9a3A">Central Force Optimization: A New Metaheuristic with Applications in Applied Electromagnetics</a></li>
<li><a href="http://www.google.com/url?sa=t&amp;source=web&amp;ct=res&amp;cd=3&amp;ved=0CBMQFjAC&amp;url=http%3A%2F%2Fwww.springerlink.com%2Findex%2Ft357063336g229g0.pdf&amp;ei=sHGOS6qhNJHk8QakxtGHDQ&amp;usg=AFQjCNFLaff2aAbN22RraGM8VIeUITQG7Q&amp;sig2=0H95M1qhSYTh6cjBFVs8Aw">Central Force Optimization: A New Nature Inspired Computational Framework for Multidimensional Search and Optimization</a></li>
<li><a href="http://www.springerlink.com/content/541400g38xt5451w/">Central Force Optimization: A New Deterministic Gradient -like Optimization  Metaheuristic</a></li>
<li><a href="http://arxiv.org/abs/1002.2798">Comparative Results: Group Search Optimizer and Central Force Optimization</a></li>
<li><a href="http://www.google.com/url?sa=t&amp;source=web&amp;ct=res&amp;cd=6&amp;ved=0CCUQFjAF&amp;url=http%3A%2F%2Farxiv.org%2Fpdf%2F1001.0317&amp;ei=s3COS4HlDNLL8Qai_cDpDA&amp;usg=AFQjCNEe64O5QI6FCBL1gZQKjyUYGsPTUw&amp;sig2=G7355osxdccvC74ovG9wHw">Pseudorandomness in Central Force Optimization</a></li>
<li><a href="http://arxiv.org/abs/1003.0221">Central Force Optimization Applied to the PBM Suite of Antenna Benchmarks</a></li>
</ol>
<p>And, for all of those interested, <a href="http://www.parallelcoding.com/wp-content/uploads/2010/07/CFO.zip">click here</a> to download my C++ and Matlab implementations.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/03/03/central-force-optimization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Particle Swarm Optimization</title>
		<link>http://www.parallelcoding.com/2010/02/01/particle-swarm-optimization/</link>
		<comments>http://www.parallelcoding.com/2010/02/01/particle-swarm-optimization/#comments</comments>
		<pubDate>Mon, 01 Feb 2010 15:20:54 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Development]]></category>
		<category><![CDATA[Heuristics]]></category>
		<category><![CDATA[Optimization]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=518</guid>
		<description><![CDATA[In pursuing some of my research as of late, I needed to use Particle Swarm Optimization. All I wanted was some simple code for both Real and Binary PSO &#8211; but I couldn&#8217;t find anything I like! So, I&#8217;m providing a file containing both along with the RNG that I used. Please be aware that [...]]]></description>
			<content:encoded><![CDATA[<p>In pursuing some of my research as of late, I needed to use Particle Swarm Optimization. All I wanted was some simple code for both Real and Binary PSO &#8211; but I couldn&#8217;t find anything I like! So, I&#8217;m providing a file containing both along with the RNG that I used. Please be aware that this code has not been refined. It&#8217;s clear, but rather ugly.<br/><br/></p>
<p><a href="http://www.parallelcoding.com/wp-content/uploads/2010/02/main.cpp">Particle Swarm Optimization Code</a></p>
<p><a href="http://www.parallelcoding.com/wp-content/uploads/2010/02/MersenneTwister.h">Mersenne Twister</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/02/01/particle-swarm-optimization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
