• No results found

The development of some rotationally invariant population based optimization methods

N/A
N/A
Protected

Academic year: 2021

Share "The development of some rotationally invariant population based optimization methods"

Copied!
81
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)
(32)
(33)
(34)
(35)
(36)
(37)
(38)
(39)
(40)
(41)
(42)
(43)
(44)
(45)
(46)
(47)
(48)
(49)
(50)
(51)
(52)
(53)
(54)
(55)
(56)
(57)
(58)
(59)
(60)
(61)
(62)
(63)
(64)
(65)
(66)
(67)
(68)
(69)
(70)
(71)
(72)
(73)
(74)
(75)
(76)
(77)
(78)
(79)
(80)
(81)

REFERENCES 70

[13] D.N. Wilke, S. Kok, and A.A. Groenwold. Comparison of linear and classical velocity update rules in particle swarm optimization: Notes on diversity. International Journal for Numerical Methods in Engineering, 70:962–984, 2007.

[14] J. Kennedy and R.C. Eberhart. Particle swarm optimization. In IEEE Conference on Neural Networks, pages 1942–1948, 1995.

[15] R.C. Eberhart and J. Kennedy. A new optimizer using particle swarm theory. In Sixth Inter-national Symposium on Micro Machine and Human Science, pages 39–43, 1995.

[16] G. Marsaglia. Choosing a point from the surface of a sphere. The Annals of Mathematical Statistics, 43(2):645–646, April 1972.

[17] R. Salomon. Some comments on evolutionary algorithm theory. Evolutionary Computation Journal, 4:4:405–415, 1996.

[18] A. Carlisle and G. Dozier. An off-the-shelf PSO: Workshop on particle swarm optimization. In Purdue School of Engineering and Technology, IN, USA,, 2001.

[19] M. N. Ras, D. N. Wilke, A. A. Groenwold, and S. Kok. On the rotational variance of the DE algorithm. 2012. Submitted.

[20] T. Takahama and S. Sakai. Solving nonlinear optimization problems by differential evolution with a rotation-invaraint crossover operation using gram-schmidt process. In Proceeding of the world congress on nature and biologically inspired computing (NaBIC2010), pages 533– 540, 2010.

[21] K. V. Price, R. M. Storn, and J. A. Lampinen. Differential Evolution: A Practical Approach to Global Optimization. Natural Computing Series. Springer-Verlag, Berlin, Germany, 2005. [22] X. Yu and M. Gen. Introduction to Evolutionary Algorithms. Springer, 2010.

[23] M. N. Ras, D. N. Wilke, A. A. Groenwold, and S. Kok. On rotationally invariant continuous-parameter genetic algorithms. 2012. Submitted.

[24] A. H. Wright. Genetic algorithms for real parameter optimization. In Gregory J. Rawlins, editor, Foundations of genetic algorithms, pages 205–218. Morgan Kaufmann, San Mateo, CA, 1991.

[25] I. Ono, H. Kita, and S. Kobayashi. A real-coded genetic algorithm using the unimodal nor-mal distribution crossover. In Ashish Ghosh and Shigeyoshi Tsutsui, editors, Advances in Evolutionary Computing, Natural Computing, pages 213–237, New York, NY, USA, 2003. Springer-Verlag.

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

Referenties

GERELATEERDE DOCUMENTEN

Maddison, PHASES OF

(Color) Maximum product yield in NO(J = 5/2) (cir- cles) and NO(J = 9/2) (triangles) encountered in seven evolutionary optimizations using the CMA algorithm, as a function of

(c) (5 pt) Show with an example how the evolutionary cycle of a differential EA works (hint: you need a mutant vector)?. (8 pt) Consider the

Following Holland’s model and assuming that the average fitness of the population is 0.4, derive the expected number of examples of H in the next

You are asked to design an evolutionary algorithm (EA) to assign orders to machines so that they are accomplished in the shortest possible time.. (Note that the time of finishing

L'analyse des poids de ces monnaies, réparties selon les quatre séries définies typologiquement (fig. 10), permet de mettre en évidence certains éléments

Figure 3 shows that selecting these elites from the random population, and carrying it to the next generation (again containing only the Elites and a new set of random

Zonder voorafgaandelijke schriftelijke toestemming van Studiebureau Archeologie bvba mag niets uit deze uitgave worden vermenigvuldigd, bewerkt en/of openbaar