L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and interval-schemata," in Foundations of Genetic Algorithms-2. San Mateo, CA: Morgan Kaufman, 1993, pp. 187--202.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... representations of solutions (but see [99] for an alternative view, and [100] for a transfer of schema theory to S expression representations used in genetic programming) Practical experience, as well as some theoretical hints regarding the binary encoding of continuous object variables [101] [102], 103] 104] 105] however, indicate that the binary representation has some disadvantages. The coding function might introduce an additional multimodality, thus making the combined objective function f = f ffi h (where f : M IR) more complex than the original problem f was. In ....

L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and interval-schemata," In Whitley [68], pp. 187--202.

....but to go against them 346 S. AKHTAR et al. instead. This generates some diversity in the society and thus helps to explore the parametric space for the global optimum. Other operators that generate intermediate variable values like the blend crossover (BLX) as proposed by Eshelman and Shaffer [8] or the simulated binary crossover (SBX) as proposed by Deb and Agrawal [9] can also potentially be used in place of the above operator. 4 EXAMPLES 4.1 Two Variable Constrained Optimization Problem This is a two variable constrained optimization problem from Koziel and Michalewicz [3] ....

Eshelman, L. J. and Shaffer, J. D. (1993). Real coded genetic algorithms and interval schemata. Foundations of Genetic Algorithms II. Morgan Kaufmann, pp. 187--202.

....with complex objective functions with F = S. Several test functions used by various researchers during the last 20 years considered only domains of n variables; this was the case with five test functions F1 F5 proposed by De Jong [2] as well as with many other test cases proposed since then [3, 4, 19]. Only recently several approaches were reported to handle general nonlinear programming problems. This paper surveys briefly these methods (next two Sections) and provides a description of a new system, Genocop III, which is based on the concepts of co evolution and repair algorithms (Section ....

Eshelman, L.J. and Schaffer, J.D, Real-Coded Genetic Algorithms and Interval Schemata, Foundations of Genetic Algorithms -- 2, Morgan Kaufmann, Los Altos, CA, 1993, pp. 187--202.

....with complex objective functions with S F = S. Several test functions used by various researchers during the last 20 years considered only domains of n variables; this was the case with five test functions F1 F5 proposed by De Jong [2] as well as with many other test cases proposed since then [3, 5, 19]. Only recently several approaches were reported to handle general nonlinear programming problems. However, their description is supported by experimental evidence based on different test cases; some of them provide results for test cases with very few variables [11, 16, 7] some of them did not ....

Eshelman, L.J. and Schaffer, J.D, Real-Coded Genetic Algorithms and Interval Schemata, Foundations of Genetic Algorithms -- 2, Morgan Kaufmann, Los Altos, CA, 1993, pp. 187--202.

....three intervals is in turn also random and according to probabilities of 25 , 50 and 25 respectively. In this present work, random mix and move has been used. However, other operators that generate intermediate variable values like the blend crossover (BLX) as proposed by Eshelman and Shaffer[6], the simulated binary crossover (SBX) as proposed by Deb and Agrawal[3] can also be used. The proposed random mix and move operator is designed to cater to continuous variables in the domain of parametric design. The operator can easily be extended to handle discrete and integer value problems. ....

Eshelman, L.J. and Shaffer, J.D.: Real coded genetic algorithms and interval schemata, Foundations of Genetic Algorithms II, Morgan Kaufmann(1993), 187-202.

....x and x , then one child corresponds to cl = x, x2 . xi, Yi : Yn) and the other c2 = Y,Y2 . Yi, xi , x) We apply this operator to 50 of the prey population. The second crossover operator is so called blend crossover operator (BLX (x) first introduced by Eshelman and Schaffer [13]. BLX ct generates a child c = c, c2 . c) where ci is a randomly (and uniformly) chosen floating number from the interval [min A. X, max A. X, where maxi = max x , Yi , mini = min x , Yi . Eshelman and Schaffer reported BLX 0.5 (with (x=0.5) gives better results than BLX with other (x ....

Eshelman, L. J. and Schaffer, J. (1991). Realcoded genetic algorithms and interval-schemata. Foundation of Genetic Algorithms, p. 187-202.

..... AN. Such operators are based on the idea that two sub optimal solutions may be 3 combined in an appropriate manner to produce an optimal result. Several crossover operators can be found in the literature: one point crossover, two points crossover, BLX o (specific for real numbers encoding [3]) The mutation operator is designed to induce small perturbations in the population. While the specific implementation details vary, the idea is to change the value of a randomly selected gene. When the genes are a binary representation of the phenotype, the mutation could be as simple as ....

Eshelman L. J. and Schaffer J. D., "Real-coded genetic algorithms and interval-schemata". Foundations of Genetic Algorithms 2, Morgan Kaufman Publishers, San Mateo, 1993, pp. 187-202.

....procedures that bear the name GA in their headline despite unfinished discussions about when an EA is no longer a GA. For quite a while binary encoding of the decision variables seemed to be a necessary ingredient until real coded GA entered the literature, see, e.g. Eshelman and Scha#er [18]) even with deterministic truncation selection (Muhlenbein and Schlierkamp Voosen [19] Due to the fact that probably more than 2000 articles are published annually since a couple of years (see Alander [20] it is more likely than not that some features of the strategies are reinvented, ....

L. J. Eshelman and J. D. Scha#er. Real-coded genetic algorithms and interval schemata. In L. D. Whitley, editor, Proc. of Foundations of Genetic Algorithms, volume 2, pages 187--202, 1991.

....The SSGA codes the function variables directly as real numbers in individuals of a static size population that evolves along the generations always preserving the best individual. It incorporates well known operators found in the literature, such as roulette wheel selection [7] blend crossover [8], and non uniform mutation [1] In order to speediness and simplicity, the method that updates the offspring into population was based on the steady state method [9] In this method, each descendant replaces one of the low fitness individuals found in the previous updating, i.e. each crossover ....

Eshelman, L.J. Schawer, J.D. Real-coded genetic algorithms and interval- schemata, in Foundation of Genetic Algorithms- 2, L. Darrell Whitley (Eds.), Morgan Kaufmann Publishers: San Mateo, 1993, pp. 187-202.

....a CGM dn of the original constrained problem) That is, the success of SA in constrained optimization depends heavily on the proper choice of penalties. Moreover, SA requires a very slow cooling schedule in order to converge to an optimal solution with high probabilities. Genetic algorithm (GA) [117, 113, 81, 66, 114, 132, 120, 123, 89, 63, 43] is a stochastic global optimization algorithm with reachability. It generally maintains a population of individuals. In each generation, it uses some genetic operators, such as crossovers and mutations, to generate new points. All the old and new points are then ranked based on a fitness ....

L. Eshelman and J. Scha#er. Real-coded genetic algorithms and interval schemata. In L. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187--202. Morgan Kaufmann Publishes, San Francisco, 1993. 120

....size. A traditional and straightforward way to encode a solution is to use binary encoding, where a solution is represented by a string of binary bits (00011010010 for example) However, for many real world problems, it is di#cult and ine#cient to use a binary representation. It has been found [54] that real number encoding performs better than binary or Gray encoding for function and constraint optimization. The reason is that the topological structure of the coding space for a real number encoding is the same as that of the original solution space. In this research, when we apply our ....

L. Eshelman and J. Scha#er. Real-coded genetic algorithms and interval schemata. In L. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187--202. Morgan Kaufmann Publishes, San Francisco, 1993.

....problems when penalties are not chosen properly. That is, the success of SA in constrained optimization depends heavily on the proper choice of penalties. Moreover, SA requires a very slow cooling schedule in order to converge to an optimal solution with high probabilities. Genetic algorithm (GA) [112, 108, 77, 62, 109, 136, 118, 123, 86, 58, 35] is a stochastic global optimization algorithm . It maintains a population of candidate points in each generation. In each generation, it uses some genetic operators, such as crossover and mutation, to generate new candidate points. All the old and new candidate points are then ranked according to ....

L. Eshelman and J. Scha#er. Real-coded genetic algorithms and interval schemata. In L. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187--202. Morgan Kaufmann Publishes, San Francisco, 1993.

.... the entire parent generation by their offspring (i.e. the offspring generation is taken as the new generation, and the parent generation is discarded after the offspring generation is created) DRAFT 3:55PM,JANUARY 2, 2001 D R A F T 50 FORMAL ENGINEERING DESIGN SYNTHESIS Elitist selection (Eshelman, 1991) is another popular deterministic selection scheme which ensures that the best chromosome is passed onto the new generation if it is not selected through another process of selection. Fitness proportionate selection does not guarantee the selection of any particular individual, including the ....

....is a basic random crossover given by Radcliffe (Radcliffe, 1990) which produces an offspring by uniformly picking a value for each gene from the range formed by the values of two corresponding parents genes. A generalized crossover, called blend crossover (denoted as BLX #) is proposed in (Eshelman and Schaffer, 1991) to introduce more variance into the operator. BLX # also uniformly picks values from a range, but this range is not formed by the values of the two parents genes. As illustrated by Figure D.4, P 1 and P 2 , the gene values (real number) of two parents, form the interval I,and#is a user defined ....

Eshelman, L. J. and Schaffer, J. (1991). Realcoded genetic algorithms and interval-schemata. Foundation of Genetic Algorithms, pages 187--202.

....use bit string representation. However, in recent years many researchers have concentrated on using real valued genes in GAs [Davis, 91] Wright 91] Janikow 91] Surry 96] Ono 97, 99] Theoretical studies of real coded GAs have also been performed [Goldberg 91a] Crossman 92] Eshelman 93] Qi 94a, b] Kita, 99] Higuch, 00] Previous studies [Tsutsui 99] Higuchi 00] have proposed simplex crossover (SPX) for real coded GAs. Let n be the number of parameters. Then, n 1 parental vectors form a simplex in R n . SPX generates offspring by uniformly sampling points inside the ....

Eshelman, L. J., and Schaffer, J. D. : Real-coded genetic algorithms and interval-schemata, Foundations of Genetic Algorithms 2, Morgan Kaufman Publishers, San Mateo, pp. 187-202 (1993).

....to a decision list [12] The structure of the set of rules will be as shown in gure 3. If conditions Then class Else If conditions Then class Else If conditions Then class . Else unknown class Fig. 2. Hierarchical set of rules. As mentioned in [4], one of the primary motivations for using real coded EAs is the precision to represent attributes values and another is the ability to exploit the gradualness of functions of continuous attributes. For that reason our algorithm uses real coding. 4 3.1 Coding In order to apply EAs to a learning ....

L. J. Eshelman and J. D. Schaer. Real-coded genetic algorithms and intervalschemata. Foundations of Genetic Algorithms-2, pages 187-202, 1993.

....problems when penalties are not chosen properly. That is, the success of SA in constrained optimization depends heavily on the proper choice of penalties. Moreover, SA requires a very slow cooling schedule in order to converge to an optimal solution with high probabilities. Genetic algorithm (GA) [112, 108, 77, 62, 109, 136, 118, 123, 86, 58, 35] is a stochastic global optimization algorithm . It maintains a population of candidate points in each generation. In each generation, it uses some genetic operators, such as crossover and mutation, to generate new candidate points. All the old and new candidate points are then ranked according to ....

L. Eshelman and J. Scha#er. Real-coded genetic algorithms and interval schemata. In L. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187--202. Morgan Kaufmann Publishes, San Francisco, 1993.

....CGM dn of the original constrained problem) That is, the success of SA in constrained optimization depends heavily on the proper choice of penalties. Moreover, SA requires a very slow cooling schedule in order to converge to an optimal solution with high probabilities. 23 Genetic algorithm (GA) [117, 113, 81, 66, 114, 132, 120, 123, 89, 63, 43] is a stochastic global optimization algorithm with reachability. It generally maintains a population of individuals. In each generation, it uses some genetic operators, such as crossovers and mutations, to generate new points. All the old and new points are then ranked based on a fitness ....

L. Eshelman and J. Schaffer. Real-coded genetic algorithms and interval schemata. In L. Whitley, editor, Foundations of Genetic Algorithms, volume 2, pages 187--202. Morgan Kaufmann Publishes, San Francisco, 1993.

....1993] Parent 1: 2.0, 3.0, 4.0, 2.5 Parent 2: 4.0, 3.0, 3.0, 1.5 Child: 3.0, 3.0, 3.5, 2.0 1.3.1. 5 Flat Crossover Flat crossover is similar to midpoint crossover, except instead of averaging the values, a new value is chosen randomly in the range between the two values of the parents [Eshelman 1993]. More than two offspring may be created. Parent 1: 2.0, 3.0, 4.0, 2.5 Parent 2: 4.0, 3.0, 3.0, 1.5 Child 1: 2.6, 3.0, 3.9, 1.8 Child 2: 2.9, 3.0, 3.1, 2.4 11 1.3.2 Mutation Mutation is typically used as a mechanism for introducing diversity into a population. Once again, the type ....

Eshelman, L. J. and Shaffer, J. D. Real-Coded Genetic Algorithms and IntervalSchemata, Foundations of Genetic Algorithms II, pp. 187-202, ed. L Darrell Whitley, Morgan Kaufman Publishers, 1993.

....of the search space. 1. Introduction In recent years, many researchers have concentrated on using real valued genes in genetic algorithms (GAs) It is reported that, for some problems, real valued encoding and associated techniques outperform conventional bit string approaches [Davis, 91] Eshelman 93] Wright 91] Janikow 91] Surry 96] Ono 97, 99] The theoretical studies of real coded GAs have also been perfomed [Goldberg 91] Crossman 92] Eshelman 93] Qi 94a, b] Previous studies [Tsutsui 98, 99] have proposed several types of multi parent recombination operators for real coded ....

.... that, for some problems, real valued encoding and associated techniques outperform conventional bit string approaches [Davis, 91] Eshelman 93] Wright 91] Janikow 91] Surry 96] Ono 97, 99] The theoretical studies of real coded GAs have also been perfomed [Goldberg 91] Crossman 92] Eshelman 93] Qi 94a, b] Previous studies [Tsutsui 98, 99] have proposed several types of multi parent recombination operators for real coded GAs. These operators did not work well on functions which have their optimum at or near the boundaries of the search space. To cope with this problem, a method was ....

Eshelman, L. J., and Schaffer, J. D. : Real-coded genetic algorithms and interval-schemata, Foundations of Genetic Algorithms 2, Morgan Kaufman Publishers, San Mateo, pp. 187-202 (1993).

....can be used to define bottle material and shape to be more significant similarity indicators than variables such as wall thickness. With the distance and similarity measures defined, genetic operators are defined to manipulate the direct representation. For real number alleles, BLX crossover (Eshelman and Schaffer 1992) is applied to each pair of continuous variables (figure 4 a) The same operator is mapped to a discrete space for interpreting between two modules selected from catalogs (figure 4 b) This catalog crossover operator was also extended to hierarchical catalog trees. A=0.3 B=0.7 d=0.4 (a) A=8 ....

Eshelman, L. J. and Schaffer, J. D. (1992). "Real-Coded Genetic Algorithms and Interval-Schemata". Foundations of Genetic Algorithms 2. L. D. Whitly. San Mateo, Kaufmann Publishers: 187-202.

....Crossover generates one (or more) solutions using two (or more) individuals. Crossover operators for real coded GAs are qualitatively similar to crossover operators defined for binary coded GAs, though the non discrete nature of the search space can be used to define new varieties of operators [7, 34]. A precise description of crossover operators is not needed for our analysis. However, I distinguish between discrete crossover operators, which can generate a finite number of possible solutions from a given pair of parent solutions, and indiscrete crossover operators, which can generate an ....

....an infinite number of solutions from a given pair of parent solutions. For example, the application of uniform crossover to swap the coordinates of the parent solutions can generate a finite number of possible solutions. In contrast, the blend crossover described by Eshelman and Shaffer [7] can generate an infinite number of possible solutions along the line connecting the two parent solutions. Mutation operates by independently perturbing each dimension of an individual probabilistically. This can be modeled by either (a) adding the value of a random variable to a dimension of an ....

[Article contains additional citation context not shown here]

L. J. Eshelman and J. D. Schaffer, Real-coded genetic algorithms and interval schemata, in Foundations of Genetic Algorithms 2, L. D. Whitley, ed., MorganKauffmann, San Mateo, CA, 1993, pp. 187--202.

.... F = S (i.e. set of constraints is empty) Several test functions used by various researchers during the last 20 years considered only domains of n variables; this was the case with five test functions F1 F5 proposed by De Jong (1975) as well as with many other test cases, e.g. Wright (1991) Eshelman and Schaffer (1993), Fogel and Stayton (1994) In the following subsections we survey several techniques that have been developed for the case of F ae S. All of these techniques use the objective function f to evaluate a feasible individual, i.e. eval f (X) f(X) for X 2 F . Most of these methods use also ....

Eshelman, L.J. and J.D. Schaffer (1993). Real-Coded Genetic Algorithms and Interval Schemata. In Foundations of Genetic Algorithms -- 2, ed. D. Whitley, Los Altos, CA, Morgan Kaufmann, 187--202.

.... should be more effective than large alphabets, practitioners have shown through a considerable amount of real world applications (particularly numerical optimization problems) that the direct use of real numbers in a chromosome works better in practice that the traditional binary representation [14, 20]. The use of real numbers in a chromosomic string (see Figure 1) has been common in other evolutionary techniques, such as evolution strategies [46] and evolutionary programming [21] where mutation is normally the primary operator. However, when dealing with GAs, there has been a strong ....

....for the genes of a chromosome, mainly because this higher cardinality representation will make the GA s behavior more erratic and difficult to predict. Because of this, several special operators have been designed over the years to emulate the effect of crossover and mutation over binary alphabets [20, 51, 19]. 8 Practitioners argue that one of the main abilities of real coded GAs is their capacity to exploit the gradualness of functions of continuous variables (where gradualness is taken to mean small changes in the variables correspond to small changes in the function) This means that real coded ....

[Article contains additional citation context not shown here]

Larry J. Eshelman and J. Davis Schaffer. Real-coded genetic algorithms and interval-schemata. In L. Darrell Whitley, editor, Foundations of Genetic Algorithms 2, pages 187--202. Morgan Kaufmann Publishers, San Mateo, California, 1993.

....fitness landscapes are possible to achieve. These crossover operators create one or two children solutions according to a probability distribution over two or more parent solutions. The most popular approach has been to use a uniform probability distribution (Blend crossover (BLX) suggested in [7]) around a region bracketing the parent solutions. There exists at least three different approaches where a non uniform probability distribution has been suggested. Of them, the simulated binary crossover (SBX) uses a bimodal probability distribution with its mode at the parent solutions [8] This ....

.... source by the transformation SBX : fi(u) 2u) 1 j 1 ; if u(0; 1) 1 2 [2(1 Gamma u) Gamma 1 j 1 ; if u(0; 1) 1 2 : 13) Note, the analysis to be performed is not restricted to the distribution (12) In addition we will investigate the BLX operator of Eshelman and Schaffer [7] and the so called fuzzy recombination by Voigt, Muhlenbein, and Cvetkovi c [6] First, BLX is considered. By using the transformation fi = 2 Gamma 1 (14) 3 From the algorithmic point of view, one might also consider operators producing only one child, as usual in Evolutions Strategies (see ....

[Article contains additional citation context not shown here]

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms, 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993.

....Thomas, 791] Elagin, V. M. 343, 422] El Hawary, M. E. 116] El Keib, A. A. 360] Ellis, C. 244] Elo, Sara, 362] Eloranta, Timo, 437, 460, 471] English, T. M. 281] English, Thomas M. 531] Engst, Norbert, 600] Erickson, J. A. 545] Esbensen, H. 481] Eshelman, Larry J. [260, 131, 261, 132, 262] Esposito, A. 97] Esquivel, S. C. 215] Evans, Philip A. 704] Fabbricatore, P. 398] Fairley, Andrew, 245] Falco, I. De, 239] Falkenauer, Emanuel, 118] Fan, Alex, 751] Fang, Hsiao Lan, 627] Authors 17 Farrell, Patrick G. 27] Faulkner, T. R. 734] Feddersen, S. 797] Fersht, ....

....Ashok, 344, 449, 490, 497, 506] Sampan, S. 82] Sampson, J. R. 695] Sangalli, Nicoletta, 642] Sannomiya, Nobuo, 181, 53] Santib a nez Koref, Ivan, 516, 517, 321] Saravanan, N. 44] Sato, K. 38] Satoh, Hiroshi, 151] Satomi, Susumu, 709] Satyadas, Antony, 413] Scha er, J. David, [259, 130, 260, 131, 261, 132, 262] Sch aftner, Christoph, 600] Schamschula, M. P. 411] Scheraga, Harold A. 736] Schippers, C. A. 198] Schirmer, R. 822] Schittko, C. 453] Schlierkamp Voosen, Dirk, 698] Schmeck, Hartmut, 355] Schmitt, Lawrence J. 230] Schnecke, V. 423] Schnier, T. 40] Schober, Andreas, 686] ....

[Article contains additional citation context not shown here]

Larry J. Eshelman and J. David Schaer. Real-coded genetic algorithms and interval-schemata. In Whitley

....Joshua, 110] DeChaine, M. D. 13] Delchambre, A. 142] Delport, V. 29] Delport, Volker, 15, 42] Deugo, Dwight, 102, 107] Dhodhi, Muhammad K. 49, 50] Dickinson, John, 41] Doi, Hirofumi, 96] Dontas, Kejitan, 36] Eaton, Malachy, 130, 54] El Hawary, M. E. 141] Eshelman, Larry J. [59, 149] Falkenauer, Emanuel, 142] Fanelli, A. 20] Farrell, Patrick G. 14] Feltus, M. A. 13] Field, P. 89] Fiorito, N. 21] Fitzhorn, P. 87] Flores, Benjamin C. 10] Fogarty, Terence C. 98] Fogel, David B. 115] Foster, James A. 41, 43] Franich, R. E. H. 153] Franti, Pasi, 24, ....

....[11, 47] Riznyk, Volodymir, 53] Riznyk, Volodymyr V. 18] Roberts, Stephen G. 103] Robinson, R. W. 11, 47] Roca, R. 35] Roupec, Jan, 123] Russo, M. 21] Ryan, Conor, 124, 135, 136] Saleh, K. A. 49, 50] Salomon, Ralf, 76] Saravanan, N. 115] Sato, K. 106] Schaffer, J. David, [58, 59, 149] Schnier, T. 104, 108] Schraudolph, Nicol N. 138, 139] Sen, Sandip, 95] Sheble, Gerald B. 141] Shimizu, Nobuhiko, 62] Smith, Richard A. 122] Snyers, D. 71] Solka, Jeffrey L. 126] Soto, I. 12] Soule, Terence, 41, 43] Surry, Patrick D. 128] Szarkowicz, Donald S. 105, 150, ....

[Article contains additional citation context not shown here]

Larry J. Eshelman and J. David Schaffer. Real-coded genetic algorithms and interval-schemata. In Darrell Whitley, editor, Foundations of Genetic Algorithms --- 2 (FOGA-92), pages 187--202, Vail, CO, 24.-29. July 1992 1992. Morgan Kaufmann: San Mateo, CA. ga:Schaffer92b.

....Michael G. 236, 354] Dymek, A. 173] Ebeling, Werner, 176] Eberhart, R. C. 177] Eiben, Agoston E. 178] Eisenhammer, Thomas, 641] Elias, John G. 179, 180, 181] El Keib, A. A. 164, 165] Ellis, C. 182] English, Thomas M. 183] Esbensen, Henrik, 184] Eshelman, Larry J. [617, 618, 697] Fagg, Andrew H. 451] Falck, E. 79] Falco, I. De, 148] Falkenauer, Emanuel, 187] Fang, Hsiao Lan, 188] Feipeng, Li, 712] Feldberg, Rasmus, 577] Fenekohal, Rahim F. 264] Ferguson, J. J. 189] Fern andez, G. 675] Fieber, M. 418] Filelis, A. 548] Filipic, Bogdan, 190, ....

....F. 615] Sandqvist, Sam, 29] Sannomiya, Nobuo, 338, 12] Sano, Chiharu, 616] Santib a nez Koref, Ivan, 104, 105, 106, 107] Sappington, David E. 135] Sarma, Jayshree, 155] Sassus, F. 161] Sato, Taisuke, 279, 280, 281] Sato, T. 655] Savini, A. 268] Schaffer, J. David, [617, 618, 697] Schizas, C. N. 495] Schlenzig, J. 204] Schlierkamp Voosen, Dirk, 510, 511, 512] Schlosser, Steve G. 680] Schmid, L. J. 637] Schmitendorf, W. E. 218] Schoneburg, E. 310, 619] Schraudolph, Nicol N. 86, 87, 88, 273] Schulte, J. W. 18] Schultz, Alan C. 157] ....

[Article contains additional citation context not shown here]

Larry J. Eshelman and J. David Schaffer. Real-coded genetic algorithms and interval-schemata. In Whitley

..... m nonoverlapping generations generation 1 generation 0 Figure 4. 1 The simple genetic algorithm somes, and three evolutionary operators: selection, crossover, and mutation [66] The chromosomes may be binary coded, or they may contain characters from a larger alphabet [69, 70]. Each chromosome is an encoding of a solution to the problem at hand, and each individual has an associated fitness which depends on the application. The initial population is typically generated randomly, but it may also be supplied by the user. A highly fit population is evolved through several ....

....operator, but the crossover and mutation operators must be modified. Crossover can occur at test vector boundaries only, and mutation involves replacing a given vector in a sequence with a randomly generated vector. Whether a binary or nonbinary coding is preferable in general is open to debate [69, 70]. However, if a nonbinary coding is used, a larger population size and mutation rate may be required to ensure adequate diversity. 4.4.2 Fitness function An accurate fitness function is necessary to achieve a high quality test set. Several factors may be important in generating a test vector or ....

L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and intervalschemata, " in Foundations of Genetic Algorithms, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, pp. 187-202, 1993.

....is likely. We shall discuss the connection of these properties of a crossover operator with self adaptive ES in Section 4. There exists a number of other real parameter GA implementations, where crossover and mutation operators are applied directly on real parameter values. Among them, Eshelman and Schaffer s (1993) blend crossover (BLX) is of importance here. For two parent points x (1;t) i and x (2;t) i (assuming x (1;t) i x (2;t) i ) the BLX ff randomly picks a point in the range [x (1;t) i Gamma ff(x (2;t) i Gamma x (1;t) i ) x (2;t) i ff(x (2;t) i Gamma x (1;t) i ) Thus, ....

Eshelman, L. J. and Schaffer, J. D. (1993). Real-coded genetic algorithms and interval schemata. Foundations of Genetic Algorithms, II (pp. 187--202).

....hypothesis which does not take the dynamic of the process into account. Though extensions of the schema theorem have been performed either for non binary encoded chromosomes (e.g. see [1] or for other structures than schemata (predicates [39] formae [30, 31] interval for real coded individuals [13]) Other works on the behavior of GAs focus on giving a proof of convergence of the algorithm, either by enhancing the schema theorem [43] 41, 26, 40] or by modeling the behavior of the GA with Markov s chain [11] 29] 8] A very interesting review of all these works is available in [27] Though ....

Larry J. Eshelman and J. David Schaffer. Real-coded genetic algorithms and interval schemata. In [44], pages 187--202, 1992.

No context found.

L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and interval-schemata," in Foundations of Genetic Algorithms-2. San Mateo, CA: Morgan Kaufman, 1993, pp. 187--202.

No context found.

Eshelman, L.J. and Scha#er, J.D. (1993): Real coded genetic algorithms and interval schemata. In: Foundations of Genetic Algorithms 2, Ed. L. Darrell Whitley (Morgan Kaufmann), pp. 187--202.

No context found.

L. J. Eshelman and J. D. Scha#er. Real-coded genetic algorithms and interval schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms, 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993.

No context found.

L. Eshelman, J. Schaer. Real-coded genetic algorithms and interval schemata. In: Foundations of Genetic Algorithms 2, Morgan Kaufmann Publishers, 1993, 187-202.

No context found.

L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and interval-schemata," in Foundations of Genetic Algorithms-2. San Mateo, CA: Morgan Kaufman, 1993, pp. 187--202.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In Foundations of Genetic Algorithms 2. Morgan Kaufmann Publishers, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval-schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In L.D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 185 -- 202. Morgan Kaufmann Publishers, 1993.

No context found.

Eshelman, L. J. and Sha#er, J. D.: Real-coded Genetic Algorithms and Interval Schemata. Foundation of Genetic Algorithms Morgan Kaufmann Publishers (1993) 182--202

No context found.

L.J. Eshelman, J.D. Sha#er, Real-coded genetic algorithms and interval schemata, in: D.L. Whitley (Ed.), Foundations of Genetic Algorithms II, Morgan Kaufman, 1993, pp. 187--202.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and intervalschemata. Foundations of Genetic Algorithms-2, pages 187--202, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In L.D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 185 -- 202. Morgan Kaufmann Publishers, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval-schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer, `Real-coded genetic algorithms and interval-schemata', Foundations of Genetic Algorithms-2, 187-- 202, (1993).

No context found.

L. Eshelman and J. Schaer. Real-coded genetic algorithms and interval schemata, 1993.

No context found.

L. J. Eshelman and J. D. Schaffer, "Real-coded genetic algorithms and interval-schemata," in Foundations of Genetic Algorithms-2. San Mateo, CA: Morgan Kaufman, 1993, pp. 187--202.

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In Foundations of Genetic Algorithms 2. Morgan Kaufmann Publishers, 1993.

No context found.

) Eshelman, L. J. and Schaffer, J. D., "Real-Coded Genetic Algorithms and Interval Schemata," Foundations of Genetic Algorithms.2, Morgan Kaufmann Publishers, Inc., San Mateo, California,

No context found.

L. J. Eshelman and J. D. Schaffer. Real-coded genetic algorithms and interval schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms, 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993. 27

No context found.

L.J. Eshelman and J.D. Schaffer, "Real-coded genetic algorithms and interval schemata," Foundations of Genetic Algorithms.2," Morgan Kaufmann Publishers, Inc., San Mateo, CA, 187-202 (1993).

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