poster

Solving discrete deceptive problems with EMMRS

Authors:

José L. Risco-Martín,

J. Ignacio Hidalgo,

Juan Lanchares,

Oscar GarnicaAuthors Info & Claims

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

Pages 1139 - 1140

https://doi.org/10.1145/1389095.1389317

Published: 12 July 2008 Publication History

Get Access

Abstract

This paper presents a new method for solving discrete deceptive problems using a genotype to phenotype mapping where a new replacement and shift operator is applied. The method is evaluated using different deceptive problems. Experimental results show how our method obtains a speed-up of 94% with respect to other approaches.

References

[1]

R. Chow. 2004. Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm. In GECCO 2004, LNCS 3102, 1006--101 Springer.

Crossref

Google Scholar

[2]

P. Schwefel. 1981. Numerical Optimization of Computer Models. John Wiley & Sons. English translation of Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, 1977.

Google Scholar

[3]

A. Törn and A. Zilinskas. 1989. Global Optimization. Lecture Notes in Computer Science, N° 350, Springer-Verlag, Berlin.

Digital Library

Google Scholar

Cited By

View all

hidalgo JColmenar JRisco-Martín JSánchez-Lacruz CLanchares JGarnica ODíaz JArnold D(2014)Solving GA-hard problems with EMMRS and GPGPUsProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2576768.2598219(1007-1014)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2576768.2598219
Li MHill SO'Riordan C(2012)Analysis of a triploid genetic algorithm over deceptive and epistatic landscapesACM SIGAPP Applied Computing Review10.1145/2387358.238736212:3(51-59)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1145/2387358.2387362
Meng LHill SO'Riordan COssowski SLecca P(2012)Analysis of a triploid genetic algorithm over deceptive landscapesProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2245324(244-249)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2245324
Show More Cited By

Index Terms

Solving discrete deceptive problems with EMMRS

Recommendations

An analysis of multi-chromosome GAs in deceptive problems
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation

This paper discusses a new approach to using GAs to solve deceptive fitness landscapes by incorporating mechanisms to control the convergence direction instead of simply increasing the population diversity. In order to overcome some of the difficulties ...
Solving GA-hard problems with EMMRS and GPGPUs
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

Different techniques have been proposed to tackle GA-Hard problems. Some techniques work with different encodings and representations, other use reordering operators and several, such as the Evolutionary Mapping Method (EMM), apply genotype-phenotype ...
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we ...

Comments

Information & Contributors

Information

Published In

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

July 2008

1814 pages

ISBN:9781605581309

DOI:10.1145/1389095

Conference Chair:
Conor Ryan
University of Limerick, Ireland
,
Editor:
Maarten Keijzer
Chordiant Software International B.V., The Netherlands

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GECCO08

Sponsor:

GECCO08: Genetic and Evolutionary Computation Conference

July 12 - 16, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
104
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

hidalgo JColmenar JRisco-Martín JSánchez-Lacruz CLanchares JGarnica ODíaz JArnold D(2014)Solving GA-hard problems with EMMRS and GPGPUsProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2576768.2598219(1007-1014)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2576768.2598219
Li MHill SO'Riordan C(2012)Analysis of a triploid genetic algorithm over deceptive and epistatic landscapesACM SIGAPP Applied Computing Review10.1145/2387358.238736212:3(51-59)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1145/2387358.2387362
Meng LHill SO'Riordan COssowski SLecca P(2012)Analysis of a triploid genetic algorithm over deceptive landscapesProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2245324(244-249)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2245324
Li MO'Riordan CHill SLanzi P(2011)An analysis of multi-chromosome GAs in deceptive problemsProceedings of the 13th annual conference on Genetic and evolutionary computation10.1145/2001576.2001715(1021-1028)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001576.2001715

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

An analysis of multi-chromosome GAs in deceptive problems

Solving GA-hard problems with EMMRS and GPGPUs

An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations