๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Geometry optimizations of benzene cluste
โœ Cai Wen-Sheng; Yu Fang; Shao Xue-Guang; Pan Zhong-Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 399 KB ๐Ÿ‘ 1 views

## 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

Global geometry optimization of clusters
โœ Bernd Hartke ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 595 KB

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

Global optimization of a dryer by using
โœ A. Hugget; P. Sรฉbastian; J.-P. Nadeau ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 162 KB ๐Ÿ‘ 2 views

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

A solution method for a resistance circu
โœ Lixin Zheng; Takao Yokota; Mitsuo Gen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 246 KB

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