Recent changes to Home

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Mon, 11 Mar 2013 20:41:58 -0000

--- v11
+++ v12
@@ -25,7 +25,7 @@
 * ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
 * ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
 * pict is a program that decomposes an image into filled rectangles using the genetic algorithm. It can also compress textures into the DXT1 or ETC1 format.
-* tsp is a graphical example program for the Travelling Salesman Problem.
+* tsp_gtk is a graphical example program for the Travelling Salesman Problem.
 * gp is an example of linear genetic programming, using the genetic algorithm to generate assembly language programs.

 Documentation can be found on the project's SourceForge webpages at .

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sat, 02 Mar 2013 00:09:10 -0000

--- v10
+++ v11
@@ -18,12 +18,12 @@

 ##### Examples #####

-* sample_ones.c is a trivial GA problem using bitstrings.
-* sample_func.c is a trivial function maximization problem using a GA.
-* sample_tsp.c implements the Travelling Salesman Problem using a genetic algorithm with permutation representation using the invert mutation and order-based crossover.
-* sample_tsp_archipelago.c does the same with an archipelago of concurrent genetic algorithms.
-* sample_ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
-* sample_ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
+* ones.c is a trivial GA problem using bitstrings.
+* func.c is a trivial function maximization problem using a GA.
+* tsp.c implements the Travelling Salesman Problem using a genetic algorithm with permutation representation using the invert mutation and order-based crossover.
+* tsp_archipelago.c does the same with an archipelago of concurrent genetic algorithms.
+* ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
+* ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
 * pict is a program that decomposes an image into filled rectangles using the genetic algorithm. It can also compress textures into the DXT1 or ETC1 format.
 * tsp is a graphical example program for the Travelling Salesman Problem.
 * gp is an example of linear genetic programming, using the genetic algorithm to generate assembly language programs.

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sat, 23 Feb 2013 13:00:02 -0000

--- v9
+++ v10
@@ -24,7 +24,7 @@
 * sample_tsp_archipelago.c does the same with an archipelago of concurrent genetic algorithms.
 * sample_ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
 * sample_ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
-* pict is a program that decomposes an image into filled rectangles using the genetic algorithm.
+* pict is a program that decomposes an image into filled rectangles using the genetic algorithm. It can also compress textures into the DXT1 or ETC1 format.
 * tsp is a graphical example program for the Travelling Salesman Problem.
 * gp is an example of linear genetic programming, using the genetic algorithm to generate assembly language programs.

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Wed, 20 Feb 2013 23:30:30 -0000

--- v8
+++ v9
@@ -6,7 +6,7 @@

 ##### fgen #####

-fgen is the interface to the genetic algorithm implementation. In addition to bitstring operators, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Steady-state evolutions is also supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.
+fgen is the interface to the genetic algorithm implementation. In addition to bitstring operators, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Steady-state evolution is also supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.

 ##### fpso #####

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Wed, 20 Feb 2013 23:29:12 -0000

--- v7
+++ v8
@@ -6,7 +6,7 @@

 ##### fgen #####

-fgen is the interface to the genetic algorithm implementation. Although it is mainly based on bitstring representation, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.
+fgen is the interface to the genetic algorithm implementation. In addition to bitstring operators, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Steady-state evolutions is also supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.

 ##### fpso #####

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Tue, 19 Feb 2013 23:49:24 -0000

--- v6
+++ v7
@@ -10,20 +10,23 @@

 ##### fpso #####

-fpso is the interface to the particle swarm optimization implementation, which provides a simple PSO with GBEST or LBEST topology and other customizable parameters. Although it can converge quickly for simple problems, for more complex higher dimensional problems the genetic algorithm performs much better.
+fpso is the interface to the particle swarm optimization implementation, which provides a simple PSO with GBEST or LBEST topology and other customizable parameters. Although it can converge quickly for simple problems, for more complex higher dimensional problems the genetic algorithm generally performs much better.

 ##### ffit #####

-ffit is the interface to straightforward multi-dimensional function minimization. It can be used for model fitting where a set of parameters is evaluated resulting in an error value. A genetic algorithm or PSO can be used to find the global minimum. Parameters can be distributed withinin a range with a profile other than linear (for example logarithmic or binomial) to optimize the searching process. When using the genetic algorithm ffit uses 16, 32 or 64-bit bitstring representations mapped to real values.
+ffit is the interface to straightforward multi-dimensional function minimization. It can be used for model fitting where a set of parameters is evaluated resulting in an error value. A genetic algorithm or PSO can be used to find the global minimum. Parameters can be distributed withinin a range with a profile other than linear (for example logarithmic or binomial) to optimize the searching process. When using the genetic algorithm ffit uses 16, 32 or 64-bit bitstring representations mapped to real values, or alternatively real-valued parameters directly.

 ##### Examples #####

 * sample_ones.c is a trivial GA problem using bitstrings.
 * sample_func.c is a trivial function maximization problem using a GA.
-* sample_tsp.c implements the Travelling Salesman Problem using a genetic algorithm with permutation representation and position-based crossover (PBX).
+* sample_tsp.c implements the Travelling Salesman Problem using a genetic algorithm with permutation representation using the invert mutation and order-based crossover.
 * sample_tsp_archipelago.c does the same with an archipelago of concurrent genetic algorithms.
 * sample_ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
 * sample_ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
+* pict is a program that decomposes an image into filled rectangles using the genetic algorithm.
+* tsp is a graphical example program for the Travelling Salesman Problem.
+* gp is an example of linear genetic programming, using the genetic algorithm to generate assembly language programs.

 Documentation can be found on the project's SourceForge webpages at .

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sun, 26 Feb 2012 02:56:46 -0000

--- v5 
+++ v6 
@@ -25,4 +25,6 @@
 * sample_ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
 * sample_ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
 
+Documentation can be found on the project's SourceForge webpages at .
+
 [[download_button]]

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sun, 26 Feb 2012 00:21:16 -0000

--- v4 
+++ v5 
@@ -10,8 +10,7 @@
 
 ##### fpso #####
 
-fpso is the interface to the particle swarm optimization implementation, which
-provides a simple PSO with GBEST or LBEST topology and other customizable parameters. Although it can converge quickly for simple problems, for more complex higher dimensional problems the genetic algorithm performs much better.
+fpso is the interface to the particle swarm optimization implementation, which provides a simple PSO with GBEST or LBEST topology and other customizable parameters. Although it can converge quickly for simple problems, for more complex higher dimensional problems the genetic algorithm performs much better.
 
 ##### ffit #####

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sat, 25 Feb 2012 22:59:37 -0000

--- v3 
+++ v4 
@@ -1,11 +1,29 @@
 libfgen --Library for optimization using a genetic algorithm or particle swarm optimization
 
-## Introduction ##
-
+##### Introduction #####
+
 libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C.
 
-## fgen ##
+##### fgen #####
 
 fgen is the interface to the genetic algorithm implementation. Although it is mainly based on bitstring representation, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.
+
+##### fpso #####
+
+fpso is the interface to the particle swarm optimization implementation, which
+provides a simple PSO with GBEST or LBEST topology and other customizable parameters. Although it can converge quickly for simple problems, for more complex higher dimensional problems the genetic algorithm performs much better.
+
+##### ffit #####
+
+ffit is the interface to straightforward multi-dimensional function minimization. It can be used for model fitting where a set of parameters is evaluated resulting in an error value. A genetic algorithm or PSO can be used to find the global minimum. Parameters can be distributed withinin a range with a profile other than linear (for example logarithmic or binomial) to optimize the searching process. When using the genetic algorithm ffit uses 16, 32 or 64-bit bitstring representations mapped to real values.
+
+##### Examples #####
+
+* sample_ones.c is a trivial GA problem using bitstrings.
+* sample_func.c is a trivial function maximization problem using a GA.
+* sample_tsp.c implements the Travelling Salesman Problem using a genetic algorithm with permutation representation and position-based crossover (PBX).
+* sample_tsp_archipelago.c does the same with an archipelago of concurrent genetic algorithms.
+* sample_ffit_rastrigin.c uses the ffit API to find the minimum of a multi-dimensional Rastrigin function using a genetic algorithm or PSO.
+* sample_ffit_rosenbrock.c does the same for the two-dimensional Rosenbrock-function.
 
 [[download_button]]

WikiPage Home modified by Harm Hanemaaijer

Harm Hanemaaijer — Sat, 25 Feb 2012 22:53:01 -0000

--- v2 
+++ v3 
@@ -1,5 +1,11 @@
 libfgen --Library for optimization using a genetic algorithm or particle swarm optimization
 
-
+## Introduction ##
+
+libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C.
+
+## fgen ##
+
+fgen is the interface to the genetic algorithm implementation. Although it is mainly based on bitstring representation, permutation-based operators are also provided and custom seeding, mutation and crossover operators can be defined by the application, also allowing use of real-valued parameters. Archipelagos of multiple concurrent GAs are supported. Internal threading allows parallel computation, especially for archipelagos, and the library is thread-safe as long as two threads do not call member functions with the same population.
 
 [[download_button]]