Extending the class of order-k delineable problems for the gene expression messy genetic algorithm
Conference
·
OSTI ID:392746
- Los Alamos National Lab., NM (United States)
- Illinois Univ., Urbana, IL (United States). Dept. of General Engineering
This paper revisits the recently introduced gene expression messy genetic algorithm (GEMGA) and offers some modifications to the extend the class of order-k delineable problems (class of problems that can be solved using a bounded order of relations) in GEMGA. The fundamental components that control the delineability of relations are reviewed in the light of the recently proposed SEARCH framework. Modified class and relation comparison statistics of GEMGA are proposed. The sample complexity of this improved version of GEMGA is shown to be subquadratic. Theoretical conclusions are also substantiated by experimental results for large, multimodal order-k delineable problems with respect to class average comparison statistic. We also present results for the recently constructed Goldberg-Lewei test functions.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 392746
- Report Number(s):
- LA-UR--96-2748; CONF-960820--5; ON: DE96014641
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computational processes of evolution and the gene expression messy genetic algorithm
Messy genetic algorithms: Recent developments
Credit card fraud detection: An application of the gene expression messy genetic algorithm
Conference
·
Wed May 01 00:00:00 EDT 1996
·
OSTI ID:251408
Messy genetic algorithms: Recent developments
Technical Report
·
Sun Sep 01 00:00:00 EDT 1996
·
OSTI ID:378868
Credit card fraud detection: An application of the gene expression messy genetic algorithm
Conference
·
Wed May 01 00:00:00 EDT 1996
·
OSTI ID:251412