Big Chemical Encyclopedia

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

Articles Figures Tables About

Genetic algorithm experiment

Lindberg N-O, Colbourn EA. Use of artificial neural networks and genetic algorithms—experiences from a tablet formulation. Pharm Tech Eur 2004 16(5) 35-9. [Pg.699]

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]

A couple of more recent texts provide gentle introductions to the subject. Evolutionary Computation by De Jong12 looks beyond the basic genetic algorithm, but does so at a studied pace, thus is suitable for those who do not yet have much experience in the field. Finally, Swarm Intelligence, by Kennedy and... [Pg.169]

Two optimization tools can be used for "virtual" catalytic experiments (i) HRS and Genetic Algorithm (GA). We have recently demonstrated [28] that HRS is a faster optimization tool than the GA. The only advantage of GA with respect to HRS is that GA uses a continuous experimental space, while HRS makes use of levels. [Pg.312]

This strategy of integrating neural networks with genetic algorithms has been used to search for the optimal composition of a catalyst for the ammoxidation of propane [62]. In that case, no experiments were performed the network was trained with data published earlier by other authors [63]. However, those data were for only 26 catalysts, thus forming a quite small training set. Even more importantly, the predicted performance of the optimal catalyst, expressed by means of acrylonitrile yield, was not experimentally verified. [Pg.167]

Although in principle a genetic algorithm, or other learning algorithm, shoutd f find the true optimum, the search is limited, either by computer limitations in th i case of numerical studies, or by experimental restrictions in the case of laboratory ir experiments. ij]... [Pg.310]

This method enables prediction of the quahty of a separation on the basis of a relatively hmited number of the experimental data, collected in previous experiments. According to this approach, the chromatographic results are interpreted in terms of the retention functions, valid for each individual solute separately. Some good examples of the interpretative strategy are the so-called window diagrams approach [20] and the search for the extremum of the multiparameter response function with the aid of the genetical algorithm [21],... [Pg.1083]


See other pages where Genetic algorithm experiment is mentioned: [Pg.99]    [Pg.388]    [Pg.99]    [Pg.388]    [Pg.2202]    [Pg.50]    [Pg.149]    [Pg.298]    [Pg.324]    [Pg.333]    [Pg.236]    [Pg.366]    [Pg.380]    [Pg.9]    [Pg.463]    [Pg.498]    [Pg.263]    [Pg.97]    [Pg.252]    [Pg.85]    [Pg.167]    [Pg.167]    [Pg.240]    [Pg.414]    [Pg.133]    [Pg.568]    [Pg.98]    [Pg.58]    [Pg.154]    [Pg.311]    [Pg.157]    [Pg.335]    [Pg.3819]    [Pg.4514]    [Pg.161]    [Pg.586]    [Pg.10]    [Pg.12]    [Pg.306]    [Pg.372]    [Pg.638]    [Pg.486]    [Pg.113]    [Pg.202]   
See also in sourсe #XX -- [ Pg.66 , Pg.67 , Pg.68 , Pg.69 , Pg.70 , Pg.71 , Pg.72 , Pg.73 ]




SEARCH



Genetic algorithm

© 2024 chempedia.info