Implicit formae in genetic algorithms

M. Jelasity, József Dombi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper discusses the term implicit/orma, which is useful for explaining the behaviour of genetic algorithms. Implicit formae are predicates over the chromosome space that are not strongly connected to the representation at hand but are capable of directing the search. After a short theoretical discussion, three examples are given for illustration, including the subset sum problem which is NP-complete.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages154-163
Number of pages10
Volume1141
ISBN (Print)354061723X, 9783540617235
DOIs
Publication statusPublished - 1996
EventInternational Conference on Evolutionary Computation - 4th International Conference on Parallel Problem Solving from Nature, PPSN 1996 - Berlin, Germany
Duration: Sep 22 1996Sep 26 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1141
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Evolutionary Computation - 4th International Conference on Parallel Problem Solving from Nature, PPSN 1996
CountryGermany
CityBerlin
Period9/22/969/26/96

Fingerprint

Chromosomes
Genetic algorithms
Genetic Algorithm
Subset Sum Problem
Predicate
Chromosome
NP-complete problem
Term

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Jelasity, M., & Dombi, J. (1996). Implicit formae in genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1141, pp. 154-163). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1141). Springer Verlag. https://doi.org/10.1007/3-540-61723-X_979

Implicit formae in genetic algorithms. / Jelasity, M.; Dombi, József.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1141 Springer Verlag, 1996. p. 154-163 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1141).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jelasity, M & Dombi, J 1996, Implicit formae in genetic algorithms. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1141, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1141, Springer Verlag, pp. 154-163, International Conference on Evolutionary Computation - 4th International Conference on Parallel Problem Solving from Nature, PPSN 1996, Berlin, Germany, 9/22/96. https://doi.org/10.1007/3-540-61723-X_979
Jelasity M, Dombi J. Implicit formae in genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1141. Springer Verlag. 1996. p. 154-163. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-61723-X_979
Jelasity, M. ; Dombi, József. / Implicit formae in genetic algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1141 Springer Verlag, 1996. pp. 154-163 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d634ae22ab404e0c9791b018f09dfc2b,
title = "Implicit formae in genetic algorithms",
abstract = "This paper discusses the term implicit/orma, which is useful for explaining the behaviour of genetic algorithms. Implicit formae are predicates over the chromosome space that are not strongly connected to the representation at hand but are capable of directing the search. After a short theoretical discussion, three examples are given for illustration, including the subset sum problem which is NP-complete.",
author = "M. Jelasity and J{\'o}zsef Dombi",
year = "1996",
doi = "10.1007/3-540-61723-X_979",
language = "English",
isbn = "354061723X",
volume = "1141",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "154--163",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Implicit formae in genetic algorithms

AU - Jelasity, M.

AU - Dombi, József

PY - 1996

Y1 - 1996

N2 - This paper discusses the term implicit/orma, which is useful for explaining the behaviour of genetic algorithms. Implicit formae are predicates over the chromosome space that are not strongly connected to the representation at hand but are capable of directing the search. After a short theoretical discussion, three examples are given for illustration, including the subset sum problem which is NP-complete.

AB - This paper discusses the term implicit/orma, which is useful for explaining the behaviour of genetic algorithms. Implicit formae are predicates over the chromosome space that are not strongly connected to the representation at hand but are capable of directing the search. After a short theoretical discussion, three examples are given for illustration, including the subset sum problem which is NP-complete.

UR - http://www.scopus.com/inward/record.url?scp=84947961342&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947961342&partnerID=8YFLogxK

U2 - 10.1007/3-540-61723-X_979

DO - 10.1007/3-540-61723-X_979

M3 - Conference contribution

AN - SCOPUS:84947961342

SN - 354061723X

SN - 9783540617235

VL - 1141

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 154

EP - 163

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -