Abonnement à la biblothèque: Guest
Journal of Automation and Information Sciences

Publication de 12  numéros par an

ISSN Imprimer: 1064-2315

ISSN En ligne: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

The Genetic Algorithms are a Modern Means of Searching Quasioptimal Solutions

Volume 35, Numéro 9, 2003, 12 pages
DOI: 10.1615/JAutomatInfScien.v35.i9.30
Get accessGet access

RÉSUMÉ

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.

Portail numérique Bibliothèque numérique eBooks Revues Références et comptes rendus Collections Prix et politiques d'abonnement Begell House Contactez-nous Language English 中文 Русский Português German French Spain