Skip to Main Content
Genetic Algorithms (GAs) are powerful search techniques. However when they are applied to complex problems, they consume large computation power. One of the choices to make them faster is to use a parallel implementation. This paper presents a parallel implementation of Combinatorial Optimisation with Coincidence Algorithm (COIN) on Graphic Processing Units. COIN is a modern GA. It has a wide range of applications. The result from the experiment shows a good speedup in comparison to a sequential implementation on modern processors.
Date of Conference: May 30 2012-June 1 2012