Genetic Algorithms and Random Keys for Sequencing and Optimization
ORSA Journal on Computing · 1994-05 · 6 (2) · 154-160
DOI: 10.1287/ijoc.6.2.154 ↗Kurz gefasst
Fachartikel in der Zeitschrift ORSA Journal on Computing, 1994-05. Verfasst von James C. Bean. Die Arbeit wurde bisher 1200-mal zitiert (Crossref).
Abstract (Originalsprache)
In this paper we present a general genetic algorithm to address a wide variety of sequencing and optimization problems including multiple machine scheduling, resource allocation, and the quadratic assignment problem. When addressing such problems, genetic algorithms typically have difficulty maintaining feasibility from parent to offspring. This is overcome with a robust representation technique called random keys. Computational results are shown for multiple machine scheduling, resource allocation, and quadratic assignment problems. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Zitieren
APA
Bean, J. C. (1994). Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal on Computing, 6(2), 154-160. https://doi.org/10.1287/ijoc.6.2.154
Vancouver
Bean JC. Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal on Computing. 1994;6(2):154-160. doi:10.1287/ijoc.6.2.154
BibTeX
@article{Bean1994,
author = {Bean, James C.},
title = {Genetic Algorithms and Random Keys for Sequencing and Optimization},
journal = {ORSA Journal on Computing},
year = {1994},
volume = {6},
number = {2},
pages = {154--160},
doi = {10.1287/ijoc.6.2.154}
}
EUVIMED