LISTSERV mailing list manager LISTSERV 16.0

Help for ECJ-INTEREST-L Archives


ECJ-INTEREST-L Archives

ECJ-INTEREST-L Archives


ECJ-INTEREST-L@LISTSERV.GMU.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Monospaced Font

LISTSERV Archives

LISTSERV Archives

ECJ-INTEREST-L Home

ECJ-INTEREST-L Home

ECJ-INTEREST-L  January 2010

ECJ-INTEREST-L January 2010

Subject:

Re: Persistence of node contents between evaluations

From:

Jake Pacheco <[log in to unmask]>

Reply-To:

ECJ Evolutionary Computation Toolkit <[log in to unmask]>

Date:

Sat, 23 Jan 2010 02:20:12 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (76 lines)

Sean,

Thanks very much, I was referring to GP. Does this mean that individuals
form one generation are never carried straight over to another (i.e. they
are always cloned)?

For my application, in clone(), I think i need to do
bar = new ArrayList();
since i want the array list to be empty at the start of every generation
(you were correct, I do not want them pointing to the same place). So, foo2
and foo3 both are in the new population and foo2.bar and foo3.bar are both
empty.

Can foo ever be in the new population as well (say, if the individual it is
a part of is carried over unaltered)? If foo can be in the new population,
is there a way to ensure that foo.bar is reinitialized? Or, are individuals
always cloned somehow before being placed in the new population?

Thanks,

Jake

On Fri, 22 Jan 2010 18:29:42 -0500, Sean Luke <[log in to unmask]> wrote:

>Jake, I presume you're talking about GP. GPNodes, GPTrees, and
>GPIndividuals all basically work like this: after a population is
>evaluated, typically the individuals undergo breeding to create new
>individuals, and then are usually eliminated. Breeding works by
>cloning subtrees, and ultimately nodes, from the old individuals to
>form new individuals. The clone method used is lightClone(), which
>ultimately calls clone() underneath.
>
>So let's say you've made got a GPNode called 'foo' which has an
>ArrayList called foo.bar. 'foo' is located in some GPIndividual, and
>the GP system has decided to copy that individual, and the subtree
>where 'foo' is located, to create a new child for the next
>generation. We call foo.clone(). This creates a new object (call it
>foo2). foo2.bar is pointing to the same ArrayList as foo.bar now.
>Now we create another new child from foo (foo's lucky!) called foo3.
>foo3.bar and foo2.bar BOTH are pointing to the same ArrayList as
>foo.bar is.
>
>This may be what you want, but I'm guessing it's not. Because now you
>evaluate the new child individual that holds foo2. It adds something
>to the foo2.bar ArrayList. When you get around to evaluating the
>individual that has foo3, it ALSO will have that thing added into its
>ArrayList because it's the same ArrayList. You probably were hoping
>them to have separate ArrayLists is my guess.
>
>To do that, you override the GPNode clone method for your particular
>GPNode subclass to call super.clone(), and then say something like:
>
> bar = (ArrayList)(bar.clone());
>
>Now foo2 and foo3 have their own copies of the ArrayList, different
>from the original one in foo, each storing what foo.bar had inside it,
>but able to add their own independent stuff without stepping on each
>others' toes.
>
>Sean
>
>On Jan 22, 2010, at 5:13 PM, Jake Pacheco wrote:
>
>> Specifically, I have a node that is meant to calculate the zero lag
>> exponential moving average of its child's value. This requires the
>> node
>> having access to its own value on the previous evaluation, as well
>> as the
>> child's value for several evaluations back. The way I implemented
>> this, the
>> node stores its value in a variable after calculation, and adds the
>> child's
>> value to an ArrayList. However, I am not sure if these are preserved
>> through
>> to the next evaluation, or, if they are preserved through evaluations,
>> whether they will be empty once the next generation starts.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

September 2019
August 2019
June 2019
April 2019
March 2019
January 2019
December 2018
November 2018
October 2018
July 2018
May 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004

ATOM RSS1 RSS2



LISTSERV.GMU.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager