[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: GA & GP
From: |
Theodore C. Belding |
Subject: |
Re: GA & GP |
Date: |
Tue, 11 Feb 1997 20:45:01 -0500 |
Hi-
Good question. This was debated extensively on the GP list, and there
doesn't seem to be a single clear-cut answer that satisfies everybody. GP
traditionally uses tree representations, but some GAs do too. GP uses a GA
to generate objects that are evaluated as programs, but some GAs do too,
etc. It's probably more a difference in emphasis and methodology than
anything else.
(What's this list coming to? Next thing you know someone's going to ask
what the definition of life is :)
-Ted
At 8:22 PM -0500 2/11/97, Kyle Chuang wrote:
>Hi,
> I have a questiong regarding GA (Genetic Algorithm) & GP (Genetic
>Programming). Sorry if this is too basic for the discussion group.
>
>What *exactly* is the difference between GA & GP? I've developed a model
>with GA for competitive analysis and have started to investigate into GP.
>Despite all the papers I've read, however, I do not see a difference
>between them. It seems that the only difference is that GA's optimization
>gives specific instructions (such as if temperature = 79 change pressure
>to 59) where as GP would give ( pressure = temperature - 20). Could
>someone please help me and clearify this?
>
>Kyle Chuang
>The Wharton School
--
Ted Belding <mailto:address@hidden>
University of Michigan Program for the Study of Complex Systems
<http://www-personal.engin.umich.edu/~streak/>
- GA & GP, Kyle Chuang, 1997/02/11
- Re: GA & GP,
Theodore C. Belding <=
- Re: GA & GP, Rick Riolo, 1997/02/11
- Re: GA & GP, glen e. p. ropella, 1997/02/12