<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Tournament selection in genetic algorithm in SAS/IML Software and Matrix Computations</title>
    <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121296#M929</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I've found the genetic algorithm documentation to be somewhat vague with regard to the details of its implementation. For example, in describing the &lt;STRONG&gt;GASETSEL call&lt;/STRONG&gt;, nothing is said about how members are chosen from the population to participate in the tournament. Is it a roulette wheel implementation?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Thu, 27 Jun 2013 18:36:18 GMT</pubDate>
    <dc:creator>stoffprof</dc:creator>
    <dc:date>2013-06-27T18:36:18Z</dc:date>
    <item>
      <title>Tournament selection in genetic algorithm</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121296#M929</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I've found the genetic algorithm documentation to be somewhat vague with regard to the details of its implementation. For example, in describing the &lt;STRONG&gt;GASETSEL call&lt;/STRONG&gt;, nothing is said about how members are chosen from the population to participate in the tournament. Is it a roulette wheel implementation?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 27 Jun 2013 18:36:18 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121296#M929</guid>
      <dc:creator>stoffprof</dc:creator>
      <dc:date>2013-06-27T18:36:18Z</dc:date>
    </item>
    <item>
      <title>Re: Tournament selection in genetic algorithm</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121297#M930</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Another example: what does the random seed in GASETUP do if a user-written initialization module is specified? Does it do anything?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 27 Jun 2013 19:05:21 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121297#M930</guid>
      <dc:creator>stoffprof</dc:creator>
      <dc:date>2013-06-27T19:05:21Z</dc:date>
    </item>
    <item>
      <title>Re: Tournament selection in genetic algorithm</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121298#M931</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Members are chosen completely at random from the population to participate in the tournament. The tournament itself generates the selection pressure to choose the fittest&amp;nbsp; member. If you are concerned that a very fit member of the population might not be chosen to participate in the tournament, you can use the elite parameter to guarantee the best solution are carried over to the next generation. There is a "Genetic Algorithms" section of the Language Reference Manual that explains the operation of the genetic algorithm routines in&amp;nbsp; more detail.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 27 Jun 2013 19:51:30 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Tournament-selection-in-genetic-algorithm/m-p/121298#M931</guid>
      <dc:creator>Hutch_sas</dc:creator>
      <dc:date>2013-06-27T19:51:30Z</dc:date>
    </item>
  </channel>
</rss>

