<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Evolutionary-Algorithms on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/evolutionary-algorithms/</link>
    <description>Recent content in Evolutionary-Algorithms on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 26 Sep 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/evolutionary-algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>DEAP vs PyGAD vs jMetal in 2026: Which Evolutionary Framework Should You Actually Use?</title>
      <link>https://www.pistack.xyz/posts/2026-09-26-evolutionary-algorithm-frameworks-deap-pygad-jmetal/</link>
      <pubDate>Sat, 26 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-09-26-evolutionary-algorithm-frameworks-deap-pygad-jmetal/</guid>
      <description>&lt;p&gt;Some problems refuse to behave. The objective has no gradient you can compute, the decision variables are discrete (which truck, which shift, which rack), and the only way to score a candidate solution is to run a simulation and look at the result. Gradient-based solvers are the wrong tool, brute force is exponential, and the honest answer is a &lt;strong&gt;population-based search&lt;/strong&gt;: generate candidates, score them, breed the better ones, repeat.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
