Proceedings of the First International Conference on Genetic Algorithms and their Applications
The DOI matches its Crossref record.
Abstract
Computer solutions to many difficult problems in science and engineering require the use of automatic search methods that consider a large number of possible solutions to the given problems. This book describes recent advances in the theory and practice of one such search method, called Genetic Algorithms. Genetic algorithms are evolutionary search techniques based on principles derived from natural population genetics, and are currently being applied to a variety of difficult problems in science, engineering, and artificial intelligence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Genetic Algorithms and Machine Learning
Goldberg, D. E., & Holland, J. H. (1988) · Machine Learning · doi:10.1023/a:1022602019183 · Cited by 3,193
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Artificial evolution for computer graphics
Sims, K. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122752 · Cited by 741
A hybrid grouping genetic algorithm for bin packing
Falkenauer, E. (1996) · Journal of Heuristics · doi:10.1007/bf00226291 · Cited by 601
Learning with genetic algorithms: An overview
De Jong, K. (1988) · Machine Learning · doi:10.1007/bf00113894 · Cited by 542
High-throughput classification of yeast mutants for functional genomics using metabolic footprinting
Allen, J., Davey, H. M., Broadhurst, D., Heald, J. K., Rowland, J. J., Oliver, S. G., & Kell, D. B. (2003) · Nature Biotechnology · doi:10.1038/nbt823 · Cited by 538
Multiobjective evolutionary algorithm test suites
van Veldhuizen, D. A., & Lamont, G. B. (1999) · Proceedings of the 1999 ACM symposium on Applied computing · doi:10.1145/298151.298382 · Cited by 447
Artificial evolution for computer graphics
Sims, K. (1991) · ACM SIGGRAPH Computer Graphics · doi:10.1145/127719.122752 · Cited by 435
Mahi, M., Baykan, Ö. K., & Kodaz, H. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.01.068 · Cited by 379
The ab-initio density matrix renormalization group in practice
Olivares-Amaya, R., Hu, W., Nakatani, N., Sharma, S., Yang, J., & Chan, G. K.-L. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4905329 · Cited by 363
Credit assignment in rule discovery systems based on genetic algorithms
Grefenstette, J. J. (1988) · Machine Learning · doi:10.1007/bf00113898 · Cited by 357
Genetic algorithms in noisy environments
Fitzpatrick, J. M., & Grefenstette, J. J. (1988) · Machine Learning · doi:10.1007/bf00113893 · Cited by 333
Lu, C., Gao, L., Li, X., Pan, Q., & Wang, Q. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.01.011 · Cited by 292
Metadata
- Venue
- Psychology Press eBooks
- Publisher
- Psychology Press
- Published
- 2014-01-02
- OpenAlex
- W2912127016
- Cited by
- 367
- References
- 0
- FWCI
- 6.58
- Type
- book
- 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
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.