staff project download information miscellaneous
Trend Download   One-cell-based Genetic Algorithm for Solving SAT Problems
  More Trend Examples

Public Key CryptoSystem

Langton's Self-Replication Loop

Game of Life

Langton's Ant

Snowflake Generation

Reaction Diffusion

One Dimensional CA

1-D Bubble Sort

2-D Bubble Sort

Image Thinning Algorithm

Genetic Drift

Emergence of Self-Replication Structures

Solving 2-SAT Problem

Solving 3-SAT Problem

Solid 2-SAT

Mouse Maze

Logic Gate Adder

Voronoi Diagram

Two Gender Solid Self-replication Loop

One-cell-based Genetic Algorithm for Solving SAT Problem

 
MangoVect DownloadPicky DownloadLucy2 DownloadGRAMAUBViz DownloadgeneDBN Download

1. Description

Genetic algorithm is one of the most popular approaches for solving combination optimization problems. In this example, we adopt the cellular genetic algorithm[1], and use it to solve 3-SAT problems on the Trend simulation environment.

The simulation results are shown in the above figure. Each bright point on the CA space represents a solution of the predicate. The SAT predicate used in this example contains 16 variables and 48 clauses. It was generated randomly by computer.

[1] D. Whitley. Cellular genetic algorithms. In Proceedings of the Fifth Int. Conference on Genetic Algorithms, 1993.

2. Download

next example

Last modified June 13, 2008 . All rights reserved.

Contact Webmaster

lab