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  March 2011

ECJ-INTEREST-L March 2011

Subject:

Re: Help on a general GA issue

From:

adil raja <[log in to unmask]>

Reply-To:

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

Date:

Wed, 9 Mar 2011 09:38:06 -0800

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (76 lines)

This is a very good idea, but it may make the whole algorithm hefty.

Best Regards,
Adil Raja



----- Original Message ----
From: doranchak <[log in to unmask]>
To: [log in to unmask]
Sent: Wed, March 9, 2011 6:30:27 PM
Subject: Re: Help on a general GA issue

A while back, i was using a GA to evolve logic puzzles, and it created many
invalid puzzles. But I didn't exclude invalid puzzles from the search, because
I was afraid that they would include good building blocks for valid puzzles.
So, my algorithm pulled error counts into the fitness function as a way to guide
the invalid puzzles towards valid ones.

I wonder if there is a good way to determine if a search is better or worse off
by doing this.

-Dave

On Mar 9, 2011, at 11:56 AM, Robert Baruch wrote:

> I, too, am interested in the answer to this question.
>
> In my own work, I've modified the crossover or mutation algorithm to explicitly
>generate valid individuals. For example, if a given element in a GA individual
>must be within a certain range, I could clip the value to the upper or lower
>limit if the value goes out of range.
>
> GP has retries when it generates individuals that are too big -- it just tries
>again. If it can't generate a valid individual after a certain number of
>retries, it gives up and copies the parent.
>
> On the other hand, sometimes you don't know that an individual is valid until
>you evaluate it. For example, perhaps an individual based on code will throw an
>exception. Then you just have to score that individual as very poor.
>
> --Rob
>
> On Mar 9, 2011, at 11:33 AM, Paul Fisher wrote:
>
>> Hello everyone
>>
>> This is a plea for help on a general point regarding the genetic algorithm
>>method (rather than a technical ECJ issue). I hope my question makes sense to
>>someone who can point me in the right direction.
>>
>> Simply put, if you have a large solution space (c.9000 element matrix) with a
>>set of constraints that make a large proportion of the possible solutions
>>invalid, how do you treat invalid solutions generated by the reproduction
>>process to ensure the population is composed of only (or mostly) valid
>>solutions? For example, what happens when you take two good solutions from the
>>initial population, cross them over and mutate them according to some standard
>>method, and the result is two solutions which happen to violate the constraints
>>of the solution space and therefore render the new solutions invalid? How can
>>you take two good solutions and mate them in such a way to produce only valid
>>solutions according to the problem constraints?
>>
>> The only way I have known how to treat invalid solutions so far is to tolerate
>>them in the population but score them out of the selection process. The problem
>>with this is that 9 times out of 10 the population will be swamped by these duds
>>and never get going.
>>
>> Any suggestions please folks?
>>
>> Thanks
>> Paul



      

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