<?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; Metaheuristics</title>
	<atom:link href="http://www.parallelcoding.com/category/heuristics/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.parallelcoding.com</link>
	<description>Intelligent, Efficient, Parallel, and Sustainable Code</description>
	<lastBuildDate>Thu, 02 Feb 2012 15:17:23 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=</generator>
		<item>
		<title>Particle Swarm Optimization (PSO) in Matlab</title>
		<link>http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/</link>
		<comments>http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/#comments</comments>
		<pubDate>Mon, 25 Apr 2011 14:58:54 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Education]]></category>
		<category><![CDATA[Matlab]]></category>
		<category><![CDATA[Metaheuristics]]></category>
		<category><![CDATA[Octave]]></category>
		<category><![CDATA[Particle Swarm Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=728</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/" title="Particle Swarm Optimization (PSO) in Matlab"></a>Here is a very simple version of PSO in Matlab. PSO is a very popular, population based metaheuristic algorithm that mimics swarming behavior and swarm intelligence in order to solve optimization problems. The code below is intended to get you &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/" title="Particle Swarm Optimization (PSO) in Matlab"></a><p>Here is a very simple version of PSO in Matlab. PSO is a very popular, population based metaheuristic algorithm that mimics swarming behavior and swarm intelligence in order to solve optimization problems.</p>
<p>The code below is intended to get you started working with PSO in Matlab or Octave. Best efforts were made to keep the code clean and easy to understand. Feel free to play with it and <a title="Contact Me" href="http://www.parallelcoding.com/contact-me/">contact</a> me with any questions.</p>
<p><a href="http://www.parallelcoding.com/wp-content/uploads/PSO/PSO.m">Click Here to Download PSO.m</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/04/25/particle-swarm-optimization-pso-in-matlab/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Genetic Algorithms on GPU using CUDA</title>
		<link>http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/</link>
		<comments>http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/#comments</comments>
		<pubDate>Wed, 13 Apr 2011 21:15:14 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[CUDA]]></category>
		<category><![CDATA[Genetic Algorithms]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=716</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/" title="Genetic Algorithms on GPU using CUDA"></a>Some references for GA on GPU. If you know of any further resources, please contact me. Downloads: PDF &#124; Bibtex [1] Q. Yu, C. Chen, and Z. Pan, “Parallel genetic algorithms on programmable graphics hardware,” in Lecture Notes in Computer &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/" title="Genetic Algorithms on GPU using CUDA"></a><p>Some references for GA on GPU. If you know of any further resources, please contact me.</p>
<p>Downloads: <a href="ttp://www.parallelcoding.com/wp-content/uploads/2011/04/GA_On_GPU.pdf">PDF</a> | <a href="http://www.parallelcoding.com/wp-content/uploads/2011/04/GA_On_GPU.bib">Bibtex</a> <br/><br/></p>
<p>[1] Q. Yu, C. Chen, and Z. Pan, “Parallel genetic algorithms on programmable graphics hardware,” in Lecture Notes in Computer Science<br />
3612. Springer, 2005, p. 1051.<br/><br />
[2] P. Pospichal and J. Jaros, “GPU-based Acceleratino of the Genetic Algorithm,” in Proceedings of GECCO 2009, 2009.<br/><br />
[3] A. Munawar, M. Wahib, M. Munetomo, and K. Akama, “Hybrid of genetic algorithm and local search to solve max-sat problem using NVIDIA CUDA framework,” Genetic Programming and Evolvable Machines, vol. 10, pp. 391–415, 2009.<br/><br />
[4] S. Debattistic, N. Marlat, L. Mussi, and S. Cagnoni, “Implementatino of a Simple Genetic Algorithm within the CUDA Architecture,” in Proceedings of GECCO 2009, 2009.<br/><br />
[5] S. Zhang and Z. He, “Implementation of parallel genetic algorithm based on cuda,” in Advances in Computation and Intelligence, ser. Lecture Notes in Computer Science, Z. Cai, Z. Li, Z. Kang, and Y. Liu, Eds. Springer Berlin / Heidelberg, 2009, vol. 5821, pp. 24–30.<br/><br />
[6] S. Tsutsui and N. Fujimoto, “Solving quadratic assignment problems by genetic algorithms with gpu computation: a case study,” in Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers,  ser. GECCO ’09. New York, NY, USA: ACM, 2009, pp. 2523–2530.<br/><br />
[7] P. Vidal and E. Alba, “A multi-gpu implementation of a cellular genetic algorithm,” in 2010 IEEE Congress on Evolutionary Computation (CEC), July 2010, pp. 1–7.<br/><br />
[8] ——, “Cellular genetic algorithm on graphic processing units,” in Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), ser. Studies in Computational Intelligence, J. Gonzlez, D. Pelta, C. Cruz, G. Terrazas, and N. Krasnogor, Eds. Springer Berlin/Heidelberg, 2010, vol. 284, pp. 223–232. <br/><br />
[9] R. Arora, R. Tulshyan, and K. Deb, “Parallelization of binary and real-coded genetic algorithms on GPU using CUDA,” in IEEE Congress on Evolutionary Computation, 2010, pp. 1–8. <br/><br />
[10] N. Fujimoto and S. Tsutsui, “A highly-parallel tsp solver for a gpu computing platform,” in Proceedings of the 7th international conference on Numerical methods and applications, ser. NMA’10. Berlin, Heidelberg: Springer-Verlag, 2011, pp. 264–271.<br/></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/04/13/genetic-algorithms-on-gpu-using-cuda/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Artificial Immune Optimization on the GPU using CUDA</title>
		<link>http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/</link>
		<comments>http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/#comments</comments>
		<pubDate>Wed, 13 Apr 2011 20:54:52 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Artificial Immune]]></category>
		<category><![CDATA[CUDA]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=712</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/" title="Artificial Immune Optimization on the GPU using CUDA"></a>Some references for AIS on GPU. If you know of any further resources, please contact me. Downloads: PDF &#124; Bibtex [1] J. Zhao, Q. Liu, W. Wang, Z. Wei, and P. Shi, “A parallel immune algorithm for traveling salesman problem &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/" title="Artificial Immune Optimization on the GPU using CUDA"></a><p>Some references for AIS on GPU. If you know of any further resources, please contact me.</p>
<p>Downloads: <a href="ttp://www.parallelcoding.com/wp-content/uploads/2011/04/AIS_On_GPU.pdf">PDF</a> | <a href="http://www.parallelcoding.com/wp-content/uploads/2011/04/AIS_On_GPU.bib">Bibtex</a> <br/><br/></p>
<p>[1] J. Zhao, Q. Liu, W. Wang, Z. Wei, and P. Shi, “A parallel immune algorithm for traveling salesman problem and its application on cold<br />
rolling scheduling,” Information Sciences, vol. 181, no. 7, pp. 1212 – 1223, 2011.<br />
[2] J. Li, L. Zhang, and L. Liu, “A Parallel Immune Algorithm Based on Fine-grained Model with GPU-Acceleration,” in Foruth International<br />
Conference on Innovative Computing, Information, and Control, 2009, pp. 683–686.<br/></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/04/13/artificial-immune-optimization-on-the-gpu/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Ant Colony Optimization on GPU using CUDA</title>
		<link>http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/</link>
		<comments>http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/#comments</comments>
		<pubDate>Mon, 11 Apr 2011 20:47:17 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Ant Colony Optimization]]></category>
		<category><![CDATA[CUDA]]></category>
		<category><![CDATA[Metaheuristics]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=705</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/" title="Ant Colony Optimization on GPU using CUDA"></a>Some references for ACO on GPU. If you know of any further resources, please contact me. Downloads: PDF &#124; Bibtex [1] J. Li, X. Hu, Z. Pang, and K. Qian, “A Parallel Ant Colony Optimization Algorithm based on Fine-Grained Model &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/" title="Ant Colony Optimization on GPU using CUDA"></a><p>Some references for ACO on GPU. If you know of any further resources, please contact me.</p>
<p>Downloads: <a href="ttp://www.parallelcoding.com/wp-content/uploads/2011/04/ACO_On_GPU.pdf">PDF</a> | <a href="http://www.parallelcoding.com/wp-content/uploads/2011/04/ACO_on_GPU.bib">Bibtex</a> <br/><br/></p>
<p>[1] J. Li, X. Hu, Z. Pang, and K. Qian, “A Parallel Ant Colony Optimization Algorithm based on Fine-Grained Model with GPU-Acceleration,” Internation Journal of Innovative Computing, Information, and Control, vol. 5, no. 11(A), November 2009.<br/><br />
[2] Y.-S. You, “Parallel ant system for traveling salesman problem on GPUs,” in Proceedings of GECCO 2009, 2009.<br/><br />
[3] S. Sanci, “A Parallel Algorithm for Flight Route Planning on GPU using CUDA,” Master’s thesis, Middle East Technical University,<br />
Turkey, 2010.<br/><br />
[4] J. M. Cecilia, J. M. Garca, M. Ujaldon, A. Nisbet, and M. Amos, “Parallelization strategies for ant colony optimisation on GPUs,”<br />
Computing Research Repository, pp. –1–1, 2011.<br/></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/04/11/ant-colony-optimization-on-gpu/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Particle Swarm Optimization on the GPU using CUDA</title>
		<link>http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/</link>
		<comments>http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/#comments</comments>
		<pubDate>Mon, 21 Mar 2011 13:41:55 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Particle Swarm Optimization]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=647</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/" title="Particle Swarm Optimization on the GPU using CUDA"></a>I'm currently doing some research into Particle Swarm Optimization (PSO) on the GPU using CUDA. As a bit of preliminary work I am gathering previous research on the topic. Below is a list of the most recent work that I &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/" title="Particle Swarm Optimization on the GPU using CUDA"></a><p>I'm currently doing some research into Particle Swarm Optimization (PSO) on the GPU using CUDA. As a bit of preliminary work I am gathering previous research on the topic. Below is a list of the most recent work that I can find including a PDF and Bibtex version of all references. If you know of any further resources, please contact me.</p>
<p>Downloads: <a href="http://www.parallelcoding.com/wp-content/uploads/2011/03/PSO_On_GPU.pdf">PDF</a> | <a href="http://www.parallelcoding.com/wp-content/uploads/2011/03/PSO_On_GPU.bib">Bibtex</a> <br/><br/></p>
<p>[1] G. A. Laguna-Snchez, M. Olgun-Carbajal, N. Cruz-Corts, and R. B.-F. J. A. Alvarez-Cedillo, “Comparative study of parallel variants for a particle swarm optimization,” Journal of Applied Research and Technology, vol. 7, no. 3, pp. 292–309, 2010.<br/><br/></p>
<p>[2] Y. Zhou and Y. Tan, “GPU-based parallel particle swarm optimization,” in Proceedings of the Eleventh conference on Congress on Evolutionary Computation, ser. CEC '09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 1493–1500.<br/><br/></p>
<p>[3] L. Mussi, S. Cagnoni, and F. Daolio, “GPU-based road sign detection using particle swarm optimization,” in Ninth International Conference on Intelligent Systems Design and Applications, December 2009, pp. 152 –157.<br/><br/></p>
<p>[4] W. Zhu and J. Curry, “Particle swarm with graphics hardware acceleration and local pattern search on bound constrained problems,” in IEEE Swarm Intelligence Symposium, 2009. SIS ’09, April 2009, pp. 1–8.<br/><br/></p>
<p>[5] L. de P. Veronese and R. Krohling, “Swarm’s flight: Accelerating the particles using C-CUDA,” in IEEE Congress on Evolutionary Computation, 2009. CEC ’09., May 2009, pp. 3264 –3270.<br/><br/></p>
<p>[6] B. Rymut and B. Kwolek, “Gpu-supported object tracking using adaptive appearance models and particle swarm optimization,” in Proceedings of the 2010 international conference on Computer vision and graphics: Part II, ser. ICCVG’10. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 227–234.<br/><br/></p>
<p>[7] C. Bastos-Filho, M. Oliveira, D. Nascimento, and A. Ramos, “Impact of the random number generator quality on particle swarm optimization algorithm running on graphic processor units,” in Hybrid Intelligent Systems (HIS), 2010 10th International Conference on, August 2010, pp. 85–90.<br/><br/></p>
<p>[8] L. Mussi, F. Daolio, and S. Cagnoni, “Evaluation of parallel particle swarm optimization algorithms within the CUDA(TM) architecture,” Information Sciences, vol. In Press, Corrected Proof, 2010.<br/><br/></p>
<p>[9] L. Mussi, S. Ivekovic, and S. Cagnoni, “Markerless articulated human body tracking from multi-view video with gpu-pso,” in Proceedings of the 9th international conference on Evolvable systems: from biology to hardware, ser. ICES’10. Berlin, Heidelberg:Springer-Verlag, 2010, pp. 97–108.<br/><br/></p>
<p>[10] Y. Tan and Y. Zhou, “Parallel particle swarm optimization algorithm based on graphic processing units,” in Handbook of Swarm Intelligence, ser. Adaptation, Learning, and Optimization, L. M. Hiot, Y. S. Ong, B. K. Panigrahi, Y. Shi, and M.-H. Lim, Eds. Springer Berlin Heidelberg, 2010, vol. 8, pp. 133–154.<br/><br/></p>
<p>[11] Y. Zhou and Y. Tan, “Particle swarm optimization with triggered mutation and its implementation based on GPU,” in Proceedings of the 12th annual conference on Genetic and evolutionary computation, ser. GECCO ’10. New York, NY, USA: ACM, 2010, pp. 1–8.<br/><br/></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/03/21/particle-swarm-optimization-on-the-gpu/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Clever Algorithms</title>
		<link>http://www.parallelcoding.com/2011/02/15/clever-algorithms/</link>
		<comments>http://www.parallelcoding.com/2011/02/15/clever-algorithms/#comments</comments>
		<pubDate>Tue, 15 Feb 2011 15:00:41 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Metaheuristics]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=634</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2011/02/15/clever-algorithms/" title="Clever Algorithms"></a>An excellent new book available at http://www.cleveralgorithms.com/]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2011/02/15/clever-algorithms/" title="Clever Algorithms"></a><p>An excellent new book available at <a href="http://www.cleveralgorithms.com/">http://www.cleveralgorithms.com/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2011/02/15/clever-algorithms/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Essentials of Metaheuristics</title>
		<link>http://www.parallelcoding.com/2010/08/10/essentials-of-metaheuristics/</link>
		<comments>http://www.parallelcoding.com/2010/08/10/essentials-of-metaheuristics/#comments</comments>
		<pubDate>Tue, 10 Aug 2010 11:44:55 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Metaheuristics]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=608</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2010/08/10/essentials-of-metaheuristics/" title="Essentials of Metaheuristics"></a>For anyone who is interested in learning the basics of metaheuristics in a concise and clear manner, I suggest that you check out Sean Luke's Essentials of Metaheuristics.]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2010/08/10/essentials-of-metaheuristics/" title="Essentials of Metaheuristics"></a><p>For anyone who is interested in learning the basics of metaheuristics in a concise and clear manner, I suggest that you check out Sean Luke's <a title="Essentials of Metaheuristics by Sean Luke" href="http://cs.gmu.edu/~sean/book/metaheuristics/">Essentials of Metaheuristics</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/08/10/essentials-of-metaheuristics/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Monte Carlo Simulation, State Space Pruning, and Meta-Heuristics</title>
		<link>http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/</link>
		<comments>http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/#comments</comments>
		<pubDate>Mon, 05 Jul 2010 14:56:50 +0000</pubDate>
		<dc:creator>Robert Green</dc:creator>
				<category><![CDATA[Ant Colony Optimization]]></category>
		<category><![CDATA[Development]]></category>
		<category><![CDATA[Genetic Algorithms]]></category>
		<category><![CDATA[Metaheuristics]]></category>
		<category><![CDATA[Monte Carlo Simulation]]></category>
		<category><![CDATA[Particle Swarm Optimization]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[State Space Pruning]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=567</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/" title="Monte Carlo Simulation, State Space Pruning, and Meta-Heuristics"></a>I haven't posted here in quite a while, mainly because I've been so busy and also because I didn't have the time to complete a proper post. As this blog is mainly about my professional career and academic interests, let me start by sharing &#8230;<p class="read-more"><a href="http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/">Read more &#187;</a></p>]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/" title="Monte Carlo Simulation, State Space Pruning, and Meta-Heuristics"></a><p>I haven't posted here in quite a while, mainly because I've been so busy and also because I didn't have the time to complete a proper post. As this blog is mainly about my professional career and academic interests, let me start by sharing some of my most recent work.</p>
<p>I have spent quite a bit of time pursuing an area of research concerned with State Space Pruning for Monte Carlo  Simulation (MCS) when calculating Reliability Indices for Power Systems. This is a necessity due to the curse of dimensionality. Simply stated, in a power system with 32 generators one finds themselves with a need to examine <img src="http://www.parallelcoding.com/wp-content/plugins/easy-latex/cache/tex_963778287e1d740a1770cd5f0636c90d.png" title="2^{32}" style="vertical-align:-20%;" class="tex" alt="2^{32}" /> states. Expand this to a larger system and suddenly the state space size explodes. In this work we've used Genetic Algorithms (GA), Repulsive Binary Particle Swarm Optimization (RBPSO), and Ant Colony Optimization (ACO) in order to reduce MCS time and iterations before convergence. In all cases we have used a binary representation (each bit represents a generator's on/off state) with a DC Optimal Power Flow (DCOPF) that has been tailored to minimize load curtailment instead of cost. The algorithms are customized in order to server our particular needs (specifically generating states in which there is no load curtailment quickly). We have had a rather good success rate over two different test systems: IEEE-RTS79 and IEEE-RTS96. For those not familiar with them, these two test systems are designed specifically for reliability testing (RTS = Reliability Testing System). RTS-79 came first and RTS-96 (for the most part) is simply 3 RTS-79 that are connected to each other with minor changes. The table below shows a brief comparison between the two systems.<br/><br />
<center></p>
<table class="tableizer-table">
<tbody>
<tr class="tableizer-firstrow">
<th></th>
<th>Generators</th>
<th>Buses</th>
<th>Lines</th>
<th>Capacity</th>
<th>Load</th>
</tr>
<tr>
<td>RTS-79</td>
<td>32</td>
<td>24</td>
<td>38</td>
<td>3405</td>
<td>2850</td>
</tr>
<tr>
<td>RTS-96</td>
<td>99</td>
<td>73</td>
<td>120</td>
<td>10215</td>
<td>8550</td>
</tr>
</tbody>
</table>
<p><label> Table I: RTS-79 and RTS-96</label><br />
</center><br />
The details of the remainder of the work can be found by contacting me or checking out the papers that we have produced. This work has produced <del datetime="2010-09-15T12:12:10+00:00">four</del> three papers that have been either accepted or submitted so far that include:</p>
<ol>
<li>R. Green, L. Wang, Z. Wang, M. Alam, and C. Singh, “Power System Reliability Assessment Using Intelligent State Space Pruning Techniques: A Comparative Study” Submitted to 2010 Conference on Power System Technology, Hangzou China, October 2010.</li>
<li><del datetime="2010-09-15T12:12:10+00:00">R. Green, L. Wang, M. Alam, and C. Singh, “State space pruning for Reliability Evaluation using Binary Particle Swarm Optimization,” Submitted to Hawaii International Conference on System Sciences,University of Hawaii at Manoa, January 2011.</del></li>
<li>R. Green, L. Wang, and C. Singh, “State space pruning for power system reliability evaluation using genetic algorithms,” IEEE Power &amp; Energy Society General Meeting 2010, Minneapolis, MN, July 2010.</li>
<li>R. Green, Z. Wang, L. Wang, M. Alam, and C. Singh, “Evaluation of loss of load probability for power systems using intelligent search based state space pruning,” The 11th International Conference on Probabilistic Methods Applied to Power Systems, Singapore, June 2010</li>
</ol>
<p>Some further resources for this work that may be helpful to others include:</p>
<ol>
<li><a title="Matpower" href="http://www.pserc.cornell.edu/matpower/" target="_blank">Matpower</a> Formulation of IEEE-RTS79 [<a href="http://www.parallelcoding.com/wp-content/uploads/Research/MCSPruning/case79.m">IEEE-RTS79 MatPower</a>]</li>
<li><a title="Matpower" href="http://www.pserc.cornell.edu/matpower/" target="_blank">Matpower</a> Formulation of IEEE-RTS96 [<a href="http://www.parallelcoding.com/wp-content/uploads/Research/MCSPruning/case96.m">IEEE-RTS96 MatPower</a>]</li>
<li>DCOPF for RTS79 in <a title="LP_Solve" href="http://sourceforge.net/projects/lpsolve/" target="_blank">LP_Solve</a> format [<a href="http://www.parallelcoding.com/wp-content/uploads/Research/MCSPruning/RTS79.lp">RTS-79 DC Optimal Power Flow</a>]</li>
<li>DCOPF for RTS96 in <a title="LP_Solve" href="http://sourceforge.net/projects/lpsolve/" target="_blank">LP_Solve</a> format [<a href="http://www.parallelcoding.com/wp-content/uploads/Research/MCSPruning/RTS96.lp">RTS-96 DC Optimal Power Flow</a>]</li>
</ol>
<p>As well as some references:</p>
<ol>
<li>Joydeep Mitra and Chanan Singh. Incorporating the dc load flow model in the decomposition-simulation method of multi-area reliability evaluation. <em>IEEE Transactions on Power Systems</em>, 11(3):1245-1254, Aug 1996.</li>
<li>Chanan Singh and Joydeep Mitra. Composite system reliability evaluation using state space pruning. <em>IEEE Transactions on Power Systems</em>, 12(1):471-479, 1997.</li>
<li>Joydeep Mitra and Chanan Singh. Pruning and simluation for determination of frequency duration indices of composite power systems. <em>IEEE Transactions on Power Systems</em>, 14(3):899-905, 1999.</li>
<li>M. Wall. GAlib: A C++ library of genetic algorithm components. <em>Mechanical Engineering Department, Massachusetts Institute of Technology</em>, 1996.</li>
<li>Lingfeng Wang and Chanan Singh. Stochastic combined heat and power dispatch based on multi-objective particle swarm optimization. <em>International Journal of Electrical Power &amp; Energy Systems</em>, 30(3), 2007.</li>
<li>Lingfeng Wang and Chanan Singh. Population-based intelligent search in reliability evaluation of generation systems with wind power penetration. <em>IEEE Transactions on Power Systems</em>, 23(3):1336-1345, May 2008.</li>
<li>Lingfeng Wang and Chanan Singh. Reliability-constrained optimum placement of reclosers and distributed generators in distribution networks using an ant colony system<br />
algorithm. <em>IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews</em>, 38(6), 2008.</li>
<li>Chanan Singh and Lingfeng Wang. Role of artificial intelligence in the reliability evaluation of electric power systems. <em>Turkish Journal of Electrical Engineering &amp; Computer Science</em>,<br />
16(3):189-200, 2008.</li>
<li>David E. Goldberg. <em>Genetic Algorithms in Search, Optimization, and Machine Learning</em>. Addison-Wesley Professional, 1 edition, Jan 1989.</li>
<li>Genetic algorithm, 2009. [ <a href="\url{http://en.wikipedia.org/wiki/Genetic\_algorithm}">Wikipedia: Genetic Algorithms</a> ]</li>
<li>Ray D. Zimmerman, E. M.-S. Carlos, and Deqiang Gan. MATPOWER: A MATLAB Power System Simulation Package, Version 3.1b2, User's Manual. Technical report, Power Systems Engineering Research Center, 2006. [ <a href="http://www.pserc.cornell.edu/matpower/">Matpower</a> ]</li>
<li>Michel Berkelaar, Kjell Eikland, and Peter Notebaert. lp_solve : Open source (mixed-integer) linear programming system. 2004.</li>
<li>IEEE Committee Report. IEEE reliability test system. <em>IEEE Transactions on Power Apparatus and Systems</em>, PAS-98(6):2047-2054, 1979.</li>
<li>C. Grigg, P. Wong, P. Albrecht, and et al. The IEEE reliability test system-1996. <em>IEEE Transactions on Power Systems</em>, 14(3):1010-1020, 1999.</li>
<li>Final report on research project 2473-10. Technical report, EPRI, 1987.</li>
<li>M.V.F Pereira and N.J. Balu. Composite generation/transmission reliability evaluation. <em>Proceedings of the IEEE</em>, 80(4):470-491, apr 1992.</li>
<li>Roy Billinton and Wenyuan Li. <em>Reliability Assessment of Electric Power Systems using Monte Carlo Methods</em>. Plenum, New York; London, 1994.</li>
<li>J. Kennedy and R. Eberhart. Particle swarm optimization. In <em>Neural Networks, 1995. Proceedings., IEEE International Conference on</em>, volume 4, August 2002.</li>
<li>Del, G. K. Venayagamoorthy, S. Mohagheghi, J. C. Hernandez, and R. G. Harley. Particle swarm optimization: Basic concepts, variants and applications in power systems. <em>Evolutionary Computation, IEEE Transactions on</em>, 12(2):171-195, 2008.</li>
<li>D. K. Agrafiotis and W. Cedeño. Feature selection for structure-activity correlation using binary particle swarms. <em>Journal of Medicinal Chemistry</em>, 45:1098-1107, 2002.</li>
<li>A. Moraglio, C. Di Chio, and R. &amp; Poli. Geometric particle swarm optimization. In <em>Proceedings of the European conference on genetic programming<br />
(EuroGP)</em>, volume 4445, pages 125-136, 2007.</li>
<li>R. Green, L. Wang, and C. Singh. State space pruning for power system reliability evaluation using genetic algorithms. In <em>Proceedings of the IEEE PES General Meeting</em>, Minneapolis,  MN, July 2010.</li>
<li>R. Green, Z. Wang, L. Wang, M. Alam, and C. Singh. Evaluation of loss of load probability for power systems using intelligent search based state space pruning. In <em>Proceedings of the 11th International Conference on Probabilistic Methods Applied to Power Systems</em>, Singapore, June 2010.</li>
<li>R. Green, L. Wang, M. Alam, and C. Singh. State space pruning for reliability evaluation using binary particle swarm optimization. Jan 2011.</li>
<li>J. Kennedy and R.C. Eberhart. A discrete binary version of the particle swarm algorithm.In <em>IEEE International Conference on Systems, Man, and Cybernetics</em>, volume 5, pages 4104-4108, 1997.</li>
<li>Riccardo Poli, James Kennedy, and Time Blackwell. Particle swarm optimization. <em>Swarm Intelligence</em>, 1(1):33-57, June 2007.</li>
<li>C. K. Mohan and B. Al-Kazemi. Discrete particle swarm optimization. Indianapolis, IN, 2001. Purdue School of Engineering and Technology.</li>
<li>R. Eberhart and James Kennedy. A new optimizer using particle swarm theory. In <em>Proceedings of the Sixth International Symposium on Micro Machine and Human Science</em>, pages 39-43, 1995.</li>
<li>M. Dorigo. <em>Optimization, Learning and Natural Algorithms</em>. PhD thesis, Politecnico di Milano, Italy, 1992.</li>
<li>Thomas Stützle and Holger H. Hoos. Max-min ant system. <em>Future Gener. Comput. Syst.</em>, 16(9):889-914, 2000.</li>
<li>Min Kong and Peng Tian. A binary ant colony optimization for the unconstrained function optimization problem. In <em>CIS (1)</em>, pages 682-687, 2005.</li>
<li>Onay Urfalioglu. Robust estimation of camera rotation, translation and focal length at high outlier rates. <em>Computer and Robot Vision, Canadian Conference</em>, 0:464-471,  2004.</li>
<li>T. Krink, J. S. Vesterstrom, and J. Riget. Particle swarm optimisation with spatial particle extension. In <em>CEC '02: Proceedings of the Evolutionary Computation on 2002.  CEC '02. Proceedings of the 2002 Congress</em>, pages 1474-1479, Washington, DC,  USA, 2002. IEEE Computer Society.</li>
<li>T. Krink, J. S. Vesterstrom, and J. Riget. Particle swarm optimisation with spatial particle extension. In <em>CEC '02: Proceedings of the Evolutionary Computation on 2002.  CEC '02. Proceedings of the 2002 Congress</em>, pages 1474-1479, Washington, DC,  USA, 2002. IEEE Computer Society.</li>
<li>J. Riget and J.S. Vesterstrøm. A diversity-guided particle swarm optimizer - the arpso. Technical report, 2002.</li>
</ol>
]]></content:encoded>
			<wfw:commentRss>http://www.parallelcoding.com/2010/07/05/monte-carlo-simulation-state-space-pruning-and-meta-heuristics/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<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[Metaheuristics]]></category>
		<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=555</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2010/05/14/informs-2010-railway-application-section-competition/" title="INFORMS 2010 Railway Application Section Competition"></a>Check it out here]]></description>
			<content:encoded><![CDATA[<a href="http://www.parallelcoding.com/2010/05/14/informs-2010-railway-application-section-competition/" title="INFORMS 2010 Railway Application Section Competition"></a><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[Metaheuristics]]></category>
		<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=552</guid>
		<description><![CDATA[<a href="http://www.parallelcoding.com/2010/05/14/metaheuristics-for-continuous-optimization/" title="Metaheuristics for Continuous Optimization"></a>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[<a href="http://www.parallelcoding.com/2010/05/14/metaheuristics-for-continuous-optimization/" title="Metaheuristics for Continuous Optimization"></a><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>
	</channel>
</rss>

