Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Genetic algorithms overview

A brief overview of different types of molecular descriptors is given in Chapter 9 about cell-based partitioning by Xue et al. this chapter also includes a description of genetic algorithm calculations. [Pg.298]

SIMCA and related methods Back propagation neural networks Decision trees Genetic algorithms Pattern recognition in data sets A Overview... [Pg.351]

T. Back, F. Hoffmeister, and H.-P. Schwefel, in Proceedings of the Fourth International Conference on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds., Morgan Kaufmann, San Mateo, CA, 1991, pp. 2-9. A Survey of Evolutionary Strategies. T. Back and H.-P. Schwefel, Evolutionary Computation, 1, 1 (1993). An Overview of Evolutionary Algorithms for Parameter Optimization. [Pg.68]

As an alternative to RSM, simulation responses can be used directly to explore the sample space of control variables. To do so, a lot of combinatorial optimization approaches were adapted for simulation optimization. In general, there are four main classes of methods that have shown a particular applicability in (multi-objective) simulation optimization Meta-heuristics, gradient-based procedures, random search, and sample path optimization. Of particular interest are meta-heuristics as they have shown a good performance for a wide range of combinatorial optimization approaches. Therefore, commercial simulation software primarily uses these techniques to incorporate simulation optimization routines. Among meta-heuristics, tabu search, scatter search, and genetic algorithms are most widely used. Table 4.13 provides an overview on aU aforementioned techniques. [Pg.186]

De Jong K (1988) Learning with genetic algorithms an overview. Mach Learn 3(2-3) 121-138... [Pg.100]

Beasley, D., Bull, D.R., Martin, R.R. (1993a), An overview of genetic algorithms Part 1 Fundamentals, University of Waies, College of Cardiff, University Computing, Cardiff, Wales, 15 (2), pp. 58-69... [Pg.430]

Halperin, 1., Ma, B., Wolfson, H., and Nussinov, R. Principles of docking an overview of search algorithms and a guide to scoring functions. Proteins Struct., Fund., Genet. 2002, 47,... [Pg.137]

Also, reviews of the current state of the art in the application of evolutionary methods to problems of interest to computational chemists have been compiled. In this article, we provide an overview of GAs, how to develop and implement them, elaborating on conunon practices across applications. We also discuss two applications to problems of relevance to computational chemistry in some detail. The article attempts to provide the reader with a primer in GAs from an application point of view and pointers to areas in the literature for other extensions, when appropriate. This article is not meant to be a review. The reader interested in a comprehensive review of past and current research in GA applications, is referred to Genetic and Evolutionary Algorithms. [Pg.1116]


See other pages where Genetic algorithms overview is mentioned: [Pg.485]    [Pg.485]    [Pg.213]    [Pg.778]    [Pg.295]    [Pg.184]    [Pg.97]    [Pg.4516]    [Pg.425]    [Pg.4515]    [Pg.80]    [Pg.342]    [Pg.364]    [Pg.423]    [Pg.27]    [Pg.344]    [Pg.478]    [Pg.989]    [Pg.86]    [Pg.250]    [Pg.285]   
See also in sourсe #XX -- [ Pg.2 , Pg.1115 ]




SEARCH



Genetic algorithm

© 2024 chempedia.info