Big Chemical Encyclopedia

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

Articles Figures Tables About

Genetic simulated annealing

Other methods which are applied to conformational analysis and to generating multiple conformations and which can be regarded as random or stochastic techniques, since they explore the conformational space in a non-deterministic fashion, arc genetic algorithms (GA) [137, 1381 simulation methods, such as molecular dynamics (MD) and Monte Carlo (MC) simulations 1139], as well as simulated annealing [140], All of those approaches and their application to generate ensembles of conformations arc discussed in Chapter II, Section 7.2 in the Handbook. [Pg.109]

Simulated Annealing-based solutions [19] are conceptually the same as Genetic Algorithm-based approaches. However, the SA-based techniques, in our experience, are more sensitive to the initial settings of the parameters. Nevertheless, once the correct ones are found, the method can achieve the efficiency of GA-based solutions. We must point out that SA-based solutions have never outperformed the GA-based ones in our studies. Much of what has been mentioned regarding the GA-based solutions is also relevant for the SA technique, particularly, with respect to the cost functions. [Pg.219]

Variable and pattern selection in a dataset can be done by genetic algorithm, simulated annealing or PCA... [Pg.224]

As might be expected, established optimisation techniques such as simulated annealing and genetic algorithms have been used to tackle the subset selection problem. These methods... [Pg.733]

E Aarts, I Korst. Simulated Annealing and Boltzmann Machines. New York Wiley, 1990. C Wilson, S Doniach. Proteins Stiaict Eunct Genet 6 193, 1989. [Pg.90]

To overcome the limitations of the database search methods, conformational search methods were developed [95,96,109]. There are many such methods, exploiting different protein representations, objective function tenns, and optimization or enumeration algorithms. The search algorithms include the minimum perturbation method [97], molecular dynamics simulations [92,110,111], genetic algorithms [112], Monte Carlo and simulated annealing [113,114], multiple copy simultaneous search [115-117], self-consistent field optimization [118], and an enumeration based on the graph theory [119]. [Pg.286]

DS Goodsell, AJ Olson. Automated docking of substrates to proteins by simulated annealing. Proteins Struct Funct Genet 8 195-202, 1990. [Pg.366]

Two of the most popular stochastic methods are simulated annealing and genetic algorithms. [Pg.40]

Various search strategies can be used to locate the optimum. Indirect search strategies do not use information on gradients, whereas direct search strategies require this information. These methods always seek to improve the objective function in each step in a search. On the other hand, stochastic search methods, such as simulated annealing and genetic algorithms, allow some deterioration... [Pg.54]

Genetic algorithms Scatter search Simulated annealing Tabu search... [Pg.411]

This criterion requires a search through a nonconvex multidimensional conformation space that contains an immense number of minima. Optimization techniques that have been applied to the problem include Monte Carlo methods, simulated annealing, genetic methods, and stochastic search, among others. For reviews of the application of various optimization methods refer to Pardalos et al. (1996), Vasquez et al. (1994), or Schlick et al. (1999). [Pg.496]

Heuristic Search / 10.5.2 Tabu Search / 10.5.3 Simulated Annealing / 10.5.4 Genetic and Evolutionary Algorithms /... [Pg.659]

II with a new chapter (for the second edition) on global optimization methods, such as tabu search, simulated annealing, and genetic algorithms. Only deterministic optimization problems are treated throughout the book because lack of space precludes discussing stochastic variables, constraints, and coefficients. [Pg.663]

There are methods that deliberately avoid the use of gradient and Hessian information. Such approaches typically require many more iterations but can nevertheless save overall on computation. Some popular ones are the Simplex Method, Genetic Algorithms, Simulated Annealing, Particle Swarm and Ant Colony Optimization, and variants thereof. [Pg.159]


See other pages where Genetic simulated annealing is mentioned: [Pg.174]    [Pg.1770]    [Pg.213]    [Pg.214]    [Pg.497]    [Pg.499]    [Pg.534]    [Pg.558]    [Pg.578]    [Pg.185]    [Pg.257]    [Pg.360]    [Pg.79]    [Pg.344]    [Pg.746]    [Pg.313]    [Pg.50]    [Pg.78]    [Pg.679]    [Pg.683]    [Pg.78]    [Pg.53]    [Pg.65]    [Pg.153]    [Pg.373]    [Pg.382]    [Pg.389]    [Pg.400]    [Pg.411]    [Pg.88]    [Pg.186]    [Pg.437]    [Pg.137]   
See also in sourсe #XX -- [ Pg.338 , Pg.339 ]




SEARCH



Objective Genetic Algorithm and Simulated Annealing with the Jumping Gene Adaptations

Simulated Annealing

Simulating annealing

© 2024 chempedia.info