✦ LIBER ✦

Selection of genetic algorithm operators for urban drainage model parameter optimisation

✍ Scribed by N.R. Siriwardene; B.J.C. Perera

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 553 KB
Volume: 44
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2006.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-objective optimisation of lidar pa

Multi-objective optimisation of lidar parameters for forest-fire detection on the basis of a genetic algorithm

✍ A. Cordoba; R. Vilar; A. Lavrov; A.B. Utkin; A. Fernandes 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A genetic algorithm for generating initi

A genetic algorithm for generating initial parameter estimations for kinetic models of catalytic processes

✍ R. Moros; H. Kalies; H.G. Rex; St. Schaffarczyk 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 758 KB

Calibration of the parameters for a hard

Calibration of the parameters for a hardening–softening constitutive model using genetic algorithms

✍ Md. Rokonuzzaman; Toshinori Sakai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 938 KB

The present paper introduces a genetic algorithm-based optimization technique to calibrate a nonlinear strain hardening-softening constitutive model for soils using five material parameters. The efficiency of the proposed technique is analyzed through the use of different GA techniques. The effects

The use of domain decomposition genetic

The use of domain decomposition genetic algorithms exploiting model reduction for the design of frequency selective surfaces

✍ Daniel S. Weile; Eric Michielssen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 803 KB

The application of domain decomposition genetic algorithms to the design of frequency selective surfaces (FSSs) is discussed. The analysis of FSS screens is brie¯y reviewed, along with a method of accelerating their characterization with a rational Krylov model order reduction technique. Using this

Theory of Genetic Algorithms II: models

Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

✍ Lothar M. Schmitt 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 596 KB

We present a theoretical framework for an asymptotically converging, scaled genetic algorithm which uses an arbitrary-size alphabet and common scaled genetic operators. The alphabet can be interpreted as a set of equidistant real numbers and multiple-spot mutation performs a scalable compromise betw