95/00502 Optimal clustering of power networks using genetic algorithms
- Publisher
- Elsevier Science
- Year
- 1995
- Weight
- 201 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0140-6701
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A modified genetic algorithm with realโnumber coding, nonโuniform mutation and arithmetical crossover operators was described in this paper. A local minimization was used to improve the final solution obtained by the genetic algorithm. Using the expโ6โ1 interatomic energy function, the
A new strategy for global geometry optimization of clusters is presented. Important features are a restriction of search space to favorable nearest-neighbor distance ranges, a suitable cluster growth representation with diminished correlations, and easy transferability of the results to larger clust
For many optimum design problems, the objectiยฎe function is the result of a complex numerical code and may not be differentiable and explicit. The first aim is to propose a way of solยฎing such complexity on an example problem. A noยฎel and global strategy inยฎolยฎing artificial neural networks and a ge
In this paper, we formulate a resistance circuit network design problem with optimal power consumption for a constrained electric current as a nonlinear integer programming (NIP) problem and solve it directly by keeping the nonlinear constraint based on genetic algorithms (GA). We discuss the effic