JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for EVOLUTIONARY-COMPUTING Archives


EVOLUTIONARY-COMPUTING Archives

EVOLUTIONARY-COMPUTING Archives


EVOLUTIONARY-COMPUTING@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

EVOLUTIONARY-COMPUTING Home

EVOLUTIONARY-COMPUTING Home

EVOLUTIONARY-COMPUTING  February 2000

EVOLUTIONARY-COMPUTING February 2000

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

New IlliGAL Reports Announcement

From:

Martin Pelikan <[log in to unmask]>

Reply-To:

Martin Pelikan <[log in to unmask]>

Date:

Wed, 02 Feb 2000 14:37:15 -0600

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (175 lines)

The Illinois Genetic Algorithms Laboratory (IlliGAL) is pleased to
announce the publication of the following new technical reports.
 
Most IlliGAL technical reports, as well as reprints of other
publications, are available in hardcopy and can be ordered from the
IlliGAL librarian, (see below for ordering information).  The technical
reports in this announcement are also available electronically on our
ftp and WWW servers (see the end of this announcement for ftp and WWW
access instructions). 
 
========================

IlliGAL Report No 2000003


Goldberg, D.E. (ed.) (2000).  

Genetic Algorithms at the University of Illinois 

Abstract not available (this report is a collection of a number of
papers from the course GE485 at the Department of General Engineering,
from the term Fall 1999).

========================

IlliGAL Report No 2000004

OMEGA - Ordering Messy GA : Solving Permutation Problems with the Fast
Messy Genetic Algorithm and Random Keys

Dimitri Knjazew and David E. Goldberg 

Abstract:
This paper presents an ordering messy genetic algorithm (OmeGA) that is
able to solve difficult permutation problems efficiently. It is
essentially a fast messy genetic algorithm (fmGA) using random keys to
represent chromosomes. Experimental results that show the random
key-based simple genetic algorithm (RKGA) being outperformed by its
messy competitor in 32-length ordering deceptive problems are presented. 

========================

IlliGAL Report No 2000005

Introducing a Genetic Generalization Pressure to the Anticipatory
Classifier System 
Part 1: Theoretical Approach 

Martin Butz, David E. Goldberg, and Wolfgang Stolzmann 

Abstract:
The Anticipatory Classifier System is a learning classifier system that
is based on the cognitive mechanism of anticipatory behavioral control.
Besides the common reward learning, the ACS is able to learn latently
(i.e. to learn in an environment without getting any reward) which is
not possible with reinforcement learning techniques. Furthermore, it is
forming a complete internal representation of the environment and thus,
it is able to use cognitive processes such as reasoning and planning.
Latest research showed that there are problems that challenge the
current ACS learning mechanism. It was observed that the ACS is not
generating accurate, maximally general rules reliably (i.e. rules which
are accurate and in the mean time as general as possible), but it is
sometimes generating over-specific rules. This paper shows how a genetic
algorithm can be used to overcome this present pressure of
over-specification in the ACS mechanism with a genetic generalization
pressure. The ACS works then as a hybrid which learns latently, forms a
cognitive map, and evolves accurate, maximally general rules.

========================

IlliGAL Report No 2000006

Introducing a Genetic Generalization Pressure to the Anticipatory
Classifier System 
Part 2: Performance Analysis 

Martin Butz, David E. Goldberg, and Wolfgang Stolzmann 

Abstract:
The Anticipatory Classifier System (ACS) is able to form a complete
internal representation of an environment. Unlike most other classifier
system and reinforcement learning approaches, it is able to learn
latently (i.e. to learn in an environment without getting any reward).
Compared to other systems which are also able to form an internal
representation of the outside world, the advantage of the ACS is that it
is not forming an identical copy of the environment but it is generating
a complete but more general model. After the observation that the model
is not necessarily maximally general a genetic generalization pressure
was introduced to the ACS (Butz:Technical Report 2000005). This paper
focuses on the different mechanisms in the anticipatory learning
process, which resembles the specification pressure, and in the genetic
algorithm, which realizes the genetic generalization pressure. The
capability of generating maximally general rules and evolving a
completely converged population is investigated in detail. Furthermore,
the paper approaches a first comparison with the XCS classifier system
in different mazes and the multiplexer problem. 

========================

IlliGAL Report No 2000007

Bad Codings and the Utility of Well-Designed Genetic Algorithms 

Franz Rothlauf, David Goldberg and Armin Heinzl 

Abstract:
This paper compares the performance of the Bayesian optimisation
algorithm (BOA) to traditional Genetic Algorithms (GAs) such as the
simple GA, or an Evolution Strategy for a real-world telecommunication
problem. Users often notice that GAs perform well for real-world
problems, but when the problem is slightly scaled up or modified, they
sometimes fail unexpectedly. Competent GAs, such as BOA, however promise
to overcome this problem more efficiently, and to behave more robustly
on demanding problems. In this practical case study we use the
pruefernumber encoding as an example of a bad encoding, that causes GAs
difficulty in finding a good solution. The results of the experiments
show that traditional GAs sometimes succeed and sometimes fail for
different parameter settings or modifications of the encoding. The
behaviour could not be predicted. The BOA however is able to perform as
well or better than the best traditional GA, and more importantly does
not fail once in this case study. It seems that the BOA is a step along
the long road towards more robust and competent GAs, that are easier to
use by real practitioners on problems with unknown complexity.  

-------------------------------------------------------------

RETRIEVAL/ORDERING:
 
   The above IlliGAL reports and publications, along with other 
   publications and source code, are available electronically via FTP or 
   WWW, or as hardcopy directly from us:
 
     FTP:    ftp ftp-illigal.ge.uiuc.edu
             login:  anonymous  
             password:  (your email address)
             cd /pub/papers/IlliGALs  (for reports)   or
             cd /pub/papers/Publications (for preprints) or
             cd /pub/src  (for GA and classifier system source code)
             binary
             get 99022.ps.Z                    (for example) 
 
    Please look at the README files for explanations of what the file 
    names mean.  IlliGAL reports are all compressed postscript files.  
 
     WWW:           To access the IlliGAL home page, open
                    http://www-illigal.ge.uiuc.edu/
 
     HARDCOPY:
 
    You can also order hardcopy versions of most IlliGAL publications
    Use the order form in the web or request them directly 
    (by IlliGAL number or title) from the IlliGAL librarian:
 
     Internet:  [log in to unmask]  Phone:  217/333-2346 
                                             Fax:    217/244-5705 
     Surface mail:   IlliGAL Librarian 
                     Department of General Engineering 
                     117 Transportation Building 
                     104 South Mathews Avenue 
                     Urbana, IL 61801-2996       USA  
 
    When ordering hardcopy, please include your surface mail address!  
 
----------------------------------------------
 Martin Pelikan
 Illinois Genetic Algorithms Laboratory
 University of Illinois at Urbana Champaign
 117 Transportation Building 
 104 S. Mathews Avenue, Urbana, IL 61801
 tel: (217) 333-2346, fax: (217) 244-5705
----------------------------------------------


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 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
October 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
August 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
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager