Journal of Automation and Information Sciences
年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
The Genetic Algorithms are a Modern Means of Searching Quasioptimal Solutions
巻 35,
発行 9, 2003,
12 pages
DOI: 10.1615/JAutomatInfScien.v35.i9.30
Get access
要約
We consider the use of genetic algorithms for solving combinatorial problems which appear while planning of production processes. On examples we discuss the methods of representation of problems of synthesis of schedules which genetic algorithms and operators of crossover and mutation are applied to.
419 記事の閲覧数
3 記事のダウンロード
記事の統計
類似内容の記事:
最新号
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020