<?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; Heuristics</title>
	<atom:link href="http://www.parallelcoding.com/category/heuristics/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>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[Heuristics]]></category>

		<guid isPermaLink="false">http://www.parallelcoding.com/?p=608</guid>
		<description><![CDATA[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&#8217;s Essentials of Metaheuristics.]]></description>
			<content:encoded><![CDATA[<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&#8217;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[Heuristics]]></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[I haven&#8217;t posted here in quite a while, mainly because I&#8217;ve been so busy and also because I didn&#8217;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. I have spent quite a bit of time pursuing [...]]]></description>
			<content:encoded><![CDATA[<p>I haven&#8217;t posted here in quite a while, mainly because I&#8217;ve been so busy and also because I didn&#8217;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_a92ab3d51879fea0fe3cf524189d6487.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&#8217;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&#8217;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 four 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>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.</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&#8217;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 &#8217;02: Proceedings of the Evolutionary Computation on 2002.  CEC &#8217;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 &#8217;02: Proceedings of the Evolutionary Computation on 2002.  CEC &#8217;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 &#8211; 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>0</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[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>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>
