RE: [Boost-users] genetic programming

Hi, Are you talking about genetic programming or optimisation using genetic algorithms? There is a big difference. There are some pretty good c++ libraries available for genetic algorithms. Galib is one that springs to mind. Solving graph problems using genetic algorithms is a bit hit and miss. Some randomising techniques have been used to solve things like mst efficiently. These are different to a genetic algorithm. As I understand it genetic programming is the concept of using genetic algorithms to write code which will solve an optimisation problem. Rather a difficult problem. Well that enough bignoting, thanks ... Richard -----Original Message----- From: boost-users-bounces@lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Martin Jynge Sent: Wednesday, 4 May 2005 10:31 PM To: boost-users@lists.boost.org Subject: [Boost-users] genetic programming Hi. Ayone interested in gp using boost?

Quoting "Lyon, Richard"
Are you talking about genetic programming or optimisation using genetic algorithms?
I'm talking about genetic programming. ga is simpler to implement and it wouldn't be suitable to boost for any reason, I think.
As I understand it genetic programming is the concept of using genetic algorithms to write code which will solve an optimisation problem.
That's not entirely the case. Standard gp is a tree rather than a string/vector (or it's likes) in genetic algorithm. The gp tree is made up of nodes with (mathematical) operations, and some sort of linking between the nodes. But then again, a graph-based gp is a generalization of the tree structure which I intend to use. regards, Martin Jynge
participants (2)
-
Lyon, Richard
-
Martin Jynge