Schwefel, H.-P. 1977. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can be very e ective: the shorter the path, the sooner the pheromone is deposited by the ants, the more the ants that use the shorter path. If appropriately used, autocatalysis can be a powerful mechanism in population based optimization algorithms (e.g. in evolutionary computation algorithms [44, 64, 82, 88] autocatalysis is implemented by the selection reproduction mechanism) In fact, it quickly favors the best individuals, so that they can direct the search process. When using autocatalysis some care must be taken to avoid premature convergence (stagnation) that is, the situation in which some ....

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Basel:Birkauser, 1977.

....the direction towards increasing fitness values. Handling ridges through specialized alteration operators has been investigated for at least 25 years. In 1977, Schwefel extended his work with Rechenberg on the Evolution Strategies (ESs) and suggested the self adaptive ES with correlated mutations [122]. The idea in self adaptation is to encode algorithmic parameters in the genome and use these parameters to modify the individual. The hypothesis is that good solutions carry good parameters; hence, evolution discovers good parameters while solving the problem. Particularly for ridges, the ....

....constant if it is 1 5. The variance is updated every N generations according to: if (t mod N = 0) #(t) n) c p s 1 5 n) c p s 1 5 n) p s = 1 5 #(t) #(t where 0.817 1.0 [9] The lower bound c = 0. 817 was theoretically derived by Schewfel for the Sphere problem [122]. Setting c 1.0 will reverse the e#ect of the control rule and be in conflict with the underlying hypothesis that a non optimal solution can always be improved by using a su#ciently small step size. 4.3.2 Evolved and adaptive rules The rule discovery process can be automated by various machine ....

[Article contains additional citation context not shown here]

Schwefel, H.-P. (1977). Numerische Optimierung von Computer Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary systems research. Birkhauser Verlag.

.... book [30] Relatively recent general attempts include program evolvers such as Olsson s Adate [33] and simpler heuristics such as Genetic Programming (GP) 8, 2] Unlike logic based program synthesizers [12, 57, 9] program evolvers use biology inspired concepts of Evolutionary Computation [34, 48] and Genetic Algorithms [14] to evolve better and better computer programs. Most existing GP implementations, however, do not even allow for programs with loops and recursion, thus ignoring a main motivation for search in program space. They either have very limited search spaces (where solution ....

H. P. Schwefel. Numerische Optimierung von Computer-Modellen. Dissertation, 1974.

....all classes of algorithms on computers, which are inspired by concepts of biology, especially the concepts evolution and genetics. In addition, terms should be avoided which have a special meaning and denote one class of evolutionary algorithms. Such EA classes are e.g. Evolutionsstrategien (ES s) [Rec94, Mut82, Sch77], genetic algorithms(GAs) Gol89] and genetic programming (GP) Koz92] For either kind there are variants and enhancements of the original algorithms. Also there are many possibilities to combine them. Evolutionary computing (EC) denotes the application of evolutionary algorithms. Ordering ....

....A schematic overview is given in figure 5.2. Examples for operators are selection, survivaling, evaluating, displaying values in a plot window, etc. Attributes are something like population (central) step (of computation) rankings (a measure for the relative e.g. Evolutionsstrategien (ES s)[Sch77], hill climbing with learning (HCwL) KPP95] stochastic hill climbing with learning by vectors of normal distributions (SHCLVND) RK96, Rud97] S 1 S 2 A 1 A 4 A 3 A 2 O 1 O 5 O 4 O 3 O 2 Sequences are orders of. Operators change. GEA Overview Figure 5.2: Principal design of GEA. ....

[Article contains additional citation context not shown here]

H.P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser Verlag, Basel, Stuttgart, 1977.

....scaling, and elitism. The best genetic algorithm for on line performance had P s 0:01, G 1, scaling of the cost function and elitism. Scwefel s test set, consisting of 62 functions that cover an enormous diversity of different topologies is surely one of the most extensive function sets. [18], pp. 319 354) Extensive empirical studies concerning the performance of various crossover operators have been performed by Schaffer et al. published in several papers which shed some light on the relation between performance, parameterization and configuration of Genetic Algorithms ( 3, 5, ....

Schwefel, II. P. (1977). Numerische optimierung von Computer-Modellen mittels der Evolutionsstrategie, In Interdisciplinary Systems Research vol. 26, pp. 319--354, Birkhauser, Basel

....to adaption, especially optimization, problems. The first ideas and experiments originate from the early sixties. They were inde pendently developed in Germany by Ingo Rechenberg [7] and in the USA by John Holland [4] These approaches were extended and further refined ( Hans Paul Schwefel [8], David Goldberg [2] The algorithms proofed to be very useful for optimization though there are only a few theoretical foundations up to now. As we will see later non of these approaches take an individual development into account. Since the beginnings of the eighties there is a strong ....

H. P. Schwefel. Numerische Optimierung von Computermodellen mittels der Evolutionsstrategie. Basel und Stuttgart: Birkhiiuser 1977

....pairs to expected discounted future reward and uses online variants of DP for constructing rewarding policies [28, 43, 49] EC runs and evaluates policies directly, building new policy candidates from those with the highest evaluations observed so far. EC methods include evolutionary strategies [23, 38], genetic algorithms (GAs) 9] genetic programming (GP) 4, 1] and adaptive extensions of Levin Search [41, 37] EC offers several advantages over DPRL, but also has some drawbacks. I will list advantages first, then point out a major problem of EC, and offer a remedy. EC Advantage 1: No ....

H. P. Schwefel. Numerische Optimierung von Computer-Modellen. Dissertation,

....= 200 100:0 x i 100:0 ; dim = 10 min(f 21 ) f 21 (0; 0) 0 A.12 f 23 : Galar [Galar, 1991] f 23 ( x) exp( 5x 2 1 ) 2 exp( 5(1 x 1 ) 2 ) exp 5 P n i=2 x 2 i 5:0 x i 5:0 ; dim = 10 min(f 23 ) f 23 (0:9965; 0; 0) 2:00686 A. 13 f 24 : Kowalik [Schwefel, 1977, Schwefel, 1995] f 24 ( x) P 11 i=1 a i x1 (b 2 i b i x2 ) b 2 i b i x3 x4 2 5:0 x i 5:0 ; dim = 4 i a i b 1 i 1 0.1957 0.25 2 0.1947 0.5 3 0.1735 1 4 0.1600 2 5 0.0844 4 6 0.0627 6 7 0.0456 8 8 0.0342 10 9 0.0323 12 10 0.0235 14 11 0.0246 16 min(f 24 ) f ....

Schwefel, H.-P. (1977). Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary systems research. Birkhauser, Basel.

....prescribed period of time is larger than 1=5, then the step size control parameter (mostly the variance of the mutation distribution) is increased by some factor, whereas it is decreased if the relative frequency of successful mutations is smaller than 1=5. This mechanism was modified by Schwefel [2] who replaced the prescribed factor by a lognormally distributed random variable and added the control parameter to the genome of each individual. As a consequence, the adjustment of the control parameter implicitly results from the competition among the individuals. Similar methods were ....

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, 1977.

....close to the global optimum because of the smaller steps. This tradeo is exploited by adaptive mutation which should ideally learn how big the mutation should be to maximize the improvement in the current stage of the algorithm. The 1=5 success rule (Rechenberg, 1973) and self adaptive ES (Schwefel, 1977) are examples of the adaptive mutation strategies. The 1 5 success rule is designed for (1 1) ES. It records the ratio of the number of successful mutations (mutations leading to an improvement) to the total number of mutations (mutations leading to inferior solutions) By increasing the ....

....Gaussian random variable with variance 1, and is the learning parameter. The above update rule assures that the mutation strength is always positive, the expected outcome of the modi cation without any selection pressure is neutral, and smaller modi cations occur more often than the large ones (Schwefel, 1977). Good mutations are ltered by a standard selection mechanism because individuals which lead to the best improvements are going to participate in the reproduction in the subsequent iteration. ES are robust to changes in the learning parameter . Schwefel suggests that should be inversely ....

[Article contains additional citation context not shown here]

Schwefel, H.-P. (1977). Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Interdisciplinary Systems Research, 26 .

....search algorithms, known as evolutionary algorithms. The most popular ones are certainly the genetic algorithms, which were developed by Holland [9] and De Jong [3] One generally distinguishes two other classes among evolutionary algorithms: evolutionary programming [5] and evolution strategies [16, 17]. A survey of these three mainstreams of evolutionary algorithms can be found in Bck s book [1] More recently, Storn and Price [19] used concepts from genetic algorithms and evolution strategies to introduce di erential evolution. The 1996 ICEC contest on the minimization of multivariable real ....

H.-P. Schwefel. Numerische optimierung von computer-modellen mittels der evolutionsstrategies, volume 26 of Interdisciplinary Systems Research. Birkhuser, Basel, 1977.

....to as machine learning algorithms , are gaining significance in the areas of modeling and optimization for fluid dynamics problems as a technology that could help reduce cost and time to market of new designs. 1. 1 Evolution strategies Some of the seminal work in this field (Rechenberg 1971, Schwefel 1974, Hoffmeister 1991) actually was aimed at improving aerodynamic shapes. As stated in (Schwefel, 1974) In 1963 two students at the Technical University of Berlin met and were soon collaborating on experiments which used the wind tunnel of the Institute of Flow Engineering. During the search for ....

....for fluid dynamics problems as a technology that could help reduce cost and time to market of new designs. 1.1 Evolution strategies Some of the seminal work in this field (Rechenberg 1971, Schwefel 1974, Hoffmeister 1991) actually was aimed at improving aerodynamic shapes. As stated in (Schwefel, 1974): In 1963 two students at the Technical University of Berlin met and were soon collaborating on experiments which used the wind tunnel of the Institute of Flow Engineering. During the search for the optimal shape of bodies in a flow, which was then a matter of laborious intuitive ....

Schwefel, H. P. 1974 Numerische Optimierung von Computer-Modellen. Birkhauser, Basel.

....several kinds of drawing turtles are implemented. 2 2. 3 Evolutionary algorithms Evolutionary algorithms (EAs) are computer based problem solving systems which use evolution processes as they can be observed in nature [6] Main types of evolutionary algorithms are evolutionary strategies [20] [22], genetic algorithms [7] 8] and genetic programming [15] Evolutionary algorithms work with populations of structures which are evolved by using genetic operators like selection, mutation and reproduction. Each individual in a population represents a possible solution of an optimization problem ....

H.-P. Schwefel. Numerische optimierung von computer-modellen mittels der evolutonsstrategie. Interdisciplinary Systems research (26), Birkhuser, Basel, 1977.

....into the representation of an individual, subsequently being subject to adaptation on an individual level. Again, this increases the importance of the mutation operator; in fact, this work finds its basis in evolutionary strategies, where the technique of self adaptation as described by Schwefel [32,33] is used extensively in modern implementations of the evolutionary strategy, taking the place of the 1 5th success rule mentioned above, however, this method does not provide a deterministic method of determining the mutation rate for an individual, and further, does not capture the idea of ....

Schwefel, H.P. 1977. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. In Interdisciplinary Systems Research. Basel: Birkhauser.

....in computational linguistics, especially for inflective languages implemented in CIFS, we refer to [15] 5. Evolutionary algorithms Evolutionary computation encompasses methods of simulating evolution on a computer. The field includes research in genetic algorithms [16] evolution strategies [17], genetic programming [18] classifier systems [19] artificial life [20] and several other problem solving strategies, that are based on biological observations, that Charles Darwin called The means of natural selection and the survival of the fittest . These algorithms are thus termed ....

H.P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, Birkhuser Verlag, Basel, Stuttgart, 1977.

....to place an offspring that is generated by mutation from the parent individual located at the center of the ellipses. Five sample individuals are shown in each of the plots. The settings for the learning rates and are recommended as upper bounds for the choice of these parameters (see [126], pp. 167 168) but one should have in mind that, depending on the particular topological characteristics of the objective function, the optimal setting of these parameters might differ from the values proposed. For the case of one self adaptable step size, however, Beyer has recently ....

H.-P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, vol. 26 of Interdisciplinary Systems Research, Birkhauser, Basel, 1977.

.... though nearly contemporaneous sources (earliest traces go all back to the early 1960s, instead we cite some later but better known ones) evolutionary programming (EP) Fogel, Owens, and Walsh [2] genetic algorithms (GA) Holland [3] evolution strategies (ES) Rechenberg [4] Schwefel [5]) does not mean that there were not more inventors of the same or at least similar ideas. Fogel [6] has made an attempt to collect a fossil record of the early birds in the field. This field called evolutionary computation (EC) since members of the three teams mentioned above met at conferences ....

....achieved within an evolution window , a range of about one decade concerning values of the standard deviation. The monotonicity of the success probability over the mutation strength has led to a simple rule for adjusting the latter (1 5 success rule) This investigation was extended by Schwefel [5, 22] for multimembered ES with # descendants per generation and just one parent, thus necessarily without recombination. Both the comma and the plus versions were considered. The asymptotic approximations of the universal laws for normalized progress velocity over normalized standard deviation are ....

[Article contains additional citation context not shown here]

H.-P. Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary Systems Research. Birkhauser, Basle, Switzerland, 1977.

No context found.

Schwefel, H.-P. 1977. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel.

No context found.

H. P. Schwefel. Numerische Optimierung von Computer-Modellen. Dissertation, 1974.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary Systems Research. Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Interdisciplinary systems research; 26. Birkhauser, Basel, 1977.

No context found.

H. P. Schwefel. Numerische Optimierung von Computer-Modellen. Dissertation, 1974.

No context found.

Schwefel, H.P. (1977) Numerische Optimierung von Computermodellen Mittels der Evolutionsstrategie, Birkhaeuser, Basel.

No context found.

Schwefel, H.P. (1977) Numerische Optimierung von Computermodellen Mittels der Evolutionsstrategie, Birkhaeuser, Basel.

No context found.

Schwefel, H.P., Numerische Optimierung von Computermodellen mittels der Evolutionsstrategie, Basel: Birkhaeuser, 1977.

No context found.

Hans-Paul Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie,volume26ofInterdisciplinary Systems Research.Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie.Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, 1977.

No context found.

Schwefel, H.P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Volume 26 of Interdisciplinary systems research. Birkhauser, Basel (1977)

No context found.

Schwefel, H.P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, Stuttgart (1977) Volume 26 of Interdisciplinary Systems Research, German.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary Systems Research. Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel, Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie. Vol. 26 of Interdisciplinary Systems Research, Basel: Birkhauser Verlag, 1977.

No context found.

H.-P. Schwefel, Numerische Optimierung von Computer{Modellen mittels der Evolutionsstrategie. Vol. 26 of Interdisciplinary Systems Research, (Birkhauser Verlag, Basel, 1977).

No context found.

H. P. Schwefel. Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie. Birkhuser Verlag. Basel, 1994.

No context found.

Hans-Paul Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Basel, Stuttgart: Birkhuser, 1977.

No context found.

Schwefel, H.-P.: Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie. Birkhauser Verlag. Basel (1994)

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, 1977.

No context found.

Hans-Paul Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie,volume26ofInterdisciplinary Systems Research.Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhauser, Basel, 1977.

No context found.

Hans-Paul Schwefel. Numerische Optimierung von ComputerModellen mittels der Evolutionsstrategie. Birkhuser, 1977.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer--Modellen mittels der Evolutionsstrategie, volume 26 of Interdisciplinary Systems Research. Birkhauser, Basel, 1977.

No context found.

H.-P. Schwefel. Numerische optimierung von computer-modellen mittels der evolutionsstrategies, volume 26 of Interdisciplinary Systems Research. Birkhuser, Basel, 1977.

No context found.

H.P. Schwefel. Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie. Birkhauser Verlag. Basel, 1994.

No context found.

H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie.Birkhauser, Basel, 1977.

No context found.

SCHWEFEL H., Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie, Birkhuser Verlag, Basel 1994.

No context found.

H.P. Schwefel. Numerische Optimierung von Computer-Modellen mittels Evolutionsstrategie. Birkhauser Verlag. Basel, 1994.

No context found.

Schwefel H.P. (1977) Numerische optimierung von Computer-Modellen mittels der Evolutionsstrategie, In Interdisciplinary Systems Research, Birkhauser, vol. 26 , 5--8.

No context found.

Schwefel H.P. (1977) Numerische optimierung von Computer-Modellen mittels der Evolutionsstrategie, \textit{In Interdisciplinary Systems Research}, Birkhauser, vol. 26 , 5--8.

No context found.

SCHWEFEL, H.-P. 1977. Numerische Optimierung von Computermodellen mittels der Evolutionsstrategie. Birkhauser.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC