Most agrochemical and pharmaceutical companies have set up high-throughput screening programs which require large numbers of compounds to screen. Combinatorial libraries provide an attractive way to deliver these compounds. A single combinatorial library with four variable positions can yield more t
Genetic local search in combinatorial optimization
β Scribed by Antoon Kolen; Erwin Pesch
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 813 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A hybrid of genetic algorithm and local optimization was tested on a massively multimodal spin-lattice problem involving a huge configuration space. The resuits are good, and global optima will probably be achieved in a sizeable proportion of cases, especially if a selection scheme is applied that m
## Abstract A genetic programmingβbased geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithmβbased techniques. Nonetheless, the genetic algorithms are still i