Big Chemical Encyclopedia

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

Articles Figures Tables About

Genetic tabu search

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

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]

C. A. Baxter, C. W. Murray, D. E. Clark, D. R. Westhead, and M. D. Eldridge, Proteins Struct., Fund., Genet., 33, 367 (1998). Flexible Docking Using Tabu Search and an Empirical Estimate of Binding Affinity. [Pg.52]

Struct., Fund., Genet., 33, 367 (1998). Flexible Docking Using Tabu Search and an Empirical Estimate of Binding Affinity. [Pg.86]

Genetic algorithms Annealing techniques Dynamic programming Collocation methods Stochastic optimisation Agent-based computations Disjunctive programming Tabu search... [Pg.520]

Hou, T., Wang, J., Chen, L. Xu, X. (1999). Automated docking of peptides and proteins by using a genetic algorithm combined with a tabu search. Protein Eng 12(8), 639-48. [Pg.436]

Baxter CA, Murray CW, Clark DE, Westhead DR, Eldridge MD. Flexible docking using tabu search and an empirical estimate of binding affinity. Proteins Struct Funct Genet 1998 33 367-382. [Pg.432]

Cao T, Li T (2004) A combination of numeric genetic algorithm and tabu search can he applied to molecular docking. Comput Biol Chem 28(4) 303-312... [Pg.31]

Compare the optimization strategies of genetic algorithms, simulated annealing, and tabu search with those of local optimization methods. [Pg.344]

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]


See other pages where Genetic tabu search is mentioned: [Pg.382]    [Pg.389]    [Pg.400]    [Pg.271]    [Pg.35]    [Pg.35]    [Pg.263]    [Pg.292]    [Pg.304]    [Pg.298]    [Pg.4027]    [Pg.268]    [Pg.270]    [Pg.910]    [Pg.355]    [Pg.915]    [Pg.720]    [Pg.10]    [Pg.10]    [Pg.108]    [Pg.800]    [Pg.29]    [Pg.239]    [Pg.107]    [Pg.154]    [Pg.216]    [Pg.84]    [Pg.76]    [Pg.371]    [Pg.255]    [Pg.266]    [Pg.278]    [Pg.363]    [Pg.396]    [Pg.925]    [Pg.140]   
See also in sourсe #XX -- [ Pg.340 , Pg.341 ]




SEARCH



Tabu search

© 2024 chempedia.info