Article

On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution

Authors:

Carlos D. Toledo-Suárez,

Manuel Valenzuela-Rendón,

Hugo Terashima-Marín,

Eduardo Uresti-CharreAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

Pages 1436 - 1443

https://doi.org/10.1145/1276958.1277222

Published: 07 July 2007 Publication History

Abstract

Considering as an optimization problem the one of knowing what is hard for a blind optimization algorithm, the usefulness of absolute algorithm-independent hardness measures is called into question, establishing as a working hypothesis the relativity in the assessment of blind search. The results of the implementation of an incremental coevolutionary algorithm for coevolving populations of tunings of a simple genetic algorithm and simulated annealing, random search and 20-bit problems are presented, showing how these results are related to two popular views of hardness for genetic search: deception and rugged fitness landscapes.

References

[1]

S. Gavrilets. Evolution and speciation on holey adaptive landscapes. Trends Ecol. Evol., 12(8):307--312, August 1997.

[2]

D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA, 1989.

Digital Library

[3]

D. E. Goldberg. The Design of Innovation. Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Boston, 2002.

Digital Library

[4]

J. Holland. Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. Morgan Kauffman, San Mateo, CA, 1986.

[5]

J. H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.

Digital Library

[6]

E. L. Johnson. Genetic algorithms as algorithm adversaries. In L. Spector et al., editors, Genetic and Evolutionary Computation Conference, pages 1314--1321. Morgan Kaufmann, 2001.

[7]

S. A. Kauffman. The Origins of Order. Self-Organization and Selection in Evolution. Oxford University Press, New York, 1993.

[8]

A. P. Kosoresow and M. P. Johnson. Finding worst-case instances of, and lower bounds for, online algorithms using genetic a lgorithms. In R. I. McKay and J. Slaney, editors, Advances in Artificial Intelligence, volume 2557 of LNAI, pages 344--355. Springer, 2002.

Digital Library

[9]

W. B. Langdon and R. Poli. Evolving problems to learn about particle swarm and other optimisers. In Congress on Evolutionary Computation, pages 81--88. IEEE, 2005.

[10]

W. B. Langdon, R. Poli, O. Holland, and T. Krink. Understanding particle swarm optimisation by evolving problem landscapes. In Swarm Intelligence Symposium, pages 30--37. IEEE, 2005.

[11]

R. A. Palacios-Durazo and M. Valenzuela-Rendón. Similarities between co-evolution and learning classifier systems. In Genetic and Evolutionary Computation Conference GECCO (2004), pages 561--572, 2004.

[12]

M. Valenzuela-Rendón and E. Uresti-Charre. A nongenerational genetic algorithm for multiobjective optimization. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 658--665. Morgan Kauffman, 1997.

[13]

J. van Hemert. Evolving combinatorial problem instances that are difficult to solve. Evolutionary Computation, pages 433--462, 2006.

Digital Library

[14]

D. Whitley. Fundamental principles of deception in genetic search. In G. J. Rawlins, editor, Foundations of Genetic Algorithms, pages 221--241. Morgan Kaufmann, San Mateo, CA, 1991.

[15]

D. Whitley and J. Watson. A 'No Free Lunch' Tutorial. Department of Computer-Science, Colorado State University, Fort Collins Colorado, 2004.

[16]

D. H. Wolpert and W. G. Macready. No Free Lunch Theorems for Search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM, 1995.

Cited By

Ren ZJiang HXuan JZhang SLuo Z(2016)Feature based problem hardness understanding for requirements engineering基于问题特征的需求工程问题难度分析Science China Information Sciences10.1007/s11432-016-0089-760:3Online publication date: 6-Dec-2016
https://doi.org/10.1007/s11432-016-0089-7
Avanaki MHojjatoleslami SSarmadi HEbrahimpour RPodoleanu A(2010)Genetic algorithm for optimization of optical systems2010 18th Iranian Conference on Electrical Engineering10.1109/IRANIANCEE.2010.5507081(172-176)Online publication date: May-2010
https://doi.org/10.1109/IRANIANCEE.2010.5507081
Nasiri-Avanaki MHojjatoleslami SPaun MTuohy SMeadway ADobre GPodoleanu A(2009)Optical coherence tomography system optimization using simulated annealing algorithmProceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering10.5555/1949006.1949124(669-674)Online publication date: 28-Sep-2009
https://dl.acm.org/doi/10.5555/1949006.1949124

Index Terms

On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution

Recommendations

A novel multi-population coevolution immune optimization algorithm

A novel multi-population coevolution immune optimization algorithm (MCIA) is proposed to solve numerical and engineering optimization problem in real world. MCIA is inspired by the mechanism that how neuroendocrine system affects T cells and B cells in ...
Supportive coevolution
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Automatically configuring and dynamically controlling an Evolutionary Algorithm's (EA's) parameters is a complex task, yet doing so allows EAs to become more powerful and require less problem specific tuning to become effective. Supportive Coevolution ...
Evaluating coevolution on a multimodal problem
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Coevolutionary algorithms are a special kind of evolutionary algorithm with advantages in solving certain specific kinds of problems. In particular, competitive coevolutionary algorithms can be used to study problems in which two sides compete against ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

July 2007

2313 pages

ISBN:9781595936974

DOI:10.1145/1276958

General Chair:
Hod Lipson
Cornell University, USA

Copyright © 2007 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, England

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
153
Total Downloads

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

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ren ZJiang HXuan JZhang SLuo Z(2016)Feature based problem hardness understanding for requirements engineering基于问题特征的需求工程问题难度分析Science China Information Sciences10.1007/s11432-016-0089-760:3Online publication date: 6-Dec-2016
https://doi.org/10.1007/s11432-016-0089-7
Avanaki MHojjatoleslami SSarmadi HEbrahimpour RPodoleanu A(2010)Genetic algorithm for optimization of optical systems2010 18th Iranian Conference on Electrical Engineering10.1109/IRANIANCEE.2010.5507081(172-176)Online publication date: May-2010
https://doi.org/10.1109/IRANIANCEE.2010.5507081
Nasiri-Avanaki MHojjatoleslami SPaun MTuohy SMeadway ADobre GPodoleanu A(2009)Optical coherence tomography system optimization using simulated annealing algorithmProceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering10.5555/1949006.1949124(669-674)Online publication date: 28-Sep-2009
https://dl.acm.org/doi/10.5555/1949006.1949124

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten