The DOI matches its Crossref record.
Representational issues in genetic optimization
Abstract
Functions are partially characterized as easy or hard for genetic algorithms to optimize. The failure modes of inappropriate embedding, crossover disruption, and deceptiveness are introduced, analyzed, and resolved in part. Virtually all optimizable (by any method) real valued functions defined on a finite domain are shown to be theoretically easy for genetic algorithms given appropriately chosen representations. Unfortunately, problems that are easy in theory can be difficult in practice because of sampling error. Also, the transformations required to induce favorable representations are generally arbitrary permutations, and the space of permutations is so large that search for good ones is intractable. The space of inversions is amenable to search, but inversions are insufficiently powerful to overcome deceptiveness. On the other hand, affine transformations (over the diadic group) are shown to be sufficiently powerful to transform at least selected deceptive problems into easy ones. These new results should be useful in guiding empirical studies and are expected to provide a foundation for further theoretical analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Eshelman, L. J. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50020-3 · Cited by 1,040
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- LIEPINS, G. E., & VOSE, M. D.
- Venue
- Journal of Experimental & Theoretical Artificial Intelligence
- Publisher
- Informa UK Limited
- Published
- 1990-04
- Volume
- 2
- Issue
- 2
- Pages
- 101-115
- ISSN
- 0952-813X (ISSN-L)
- 1362-3079
- OpenAlex
- W1967093065
- Cited by
- 185
- References
- 0
- FWCI
- 10.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Representational issues in genetic optimization. https://app.cochat.ai/papers/10.1080/09528139008953717
- The paper
- LIEPINS, G. E., & VOSE, M. D. (1990). Representational issues in genetic optimization. Journal of Experimental & Theoretical Artificial Intelligence. https://doi.org/10.1080/09528139008953717
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.