• Keine Ergebnisse gefunden

Exercise 5: Implementation of a Simple Evolution Strategy Date: Summer Term 2006

N/A
N/A
Protected

Academic year: 2021

Aktie "Exercise 5: Implementation of a Simple Evolution Strategy Date: Summer Term 2006"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Exercise 5: Implementation of a Simple Evolution Strategy

Date: Summer Term 2006

Now, its time to implement a simple evolution strategy by yourself. Most of the parts are already

prepared for you as you can see from the documentationhttp://www-md.e-technik.uni-rostock.de First of all, you are strongly advised to read the API documentation.

Unit 1: Download the prepared material and read the API documentation.

Unit 2: Implement themainfunction of the simpleea-program. The fitness function should be simply the sum of the squared xi, which is also known as the sphere model.

Where does this function have its minimum? Test the program by running it for a few generations in order to see whether you did everything correctly or not.

Unit 3: To get a deeper understanding of the nature of an evolutionary algorithm, you should now implement themutation object()-routine by yourself. Also, implement a simple uniform crossover operator that may work on two successive offspring.

Unit 4: You are now almost ready to solve the minimization of the power distribution net- work from exercise 2. Replace the fitness function (i.e., the sphere model as noted above), by the calculation of the total network length (as described in exercise 2).

Questions: How many parametersxido you need? How can you map those parame- ters onto the specification of the distributersDi?

Test your program by doing some runs and report your minimal network length to the teacher.

Have fun, Hagen and Ralf.

1

Referenzen

ÄHNLICHE DOKUMENTE

By doing this exercise, you should be getting some experiences in how to design an (optimiza- tion) application that can be processed by a computer.. Consider the

The positions, i.e., the x and y coordinates, of the transformer and the houses are fixed and can be found in

Monte Carlo (Global Random Search): This method visits “every” point in search space at random with equal probability.. Systematic Search: This method systematically visits

Write a program that prints 100 lines each of which should contain the line number and one Gaussian-distributed random number2. Reuse the program but print the squares of the

Unit 1: Implement a simple Monte Carlo and a simple systematic search strategy by us- ing the programming framework already used in exercise 5.. How do these

Unit 1: parent ↔ offspring relation: Consider the two most commonly used mutation prob- abilities p m = 1 (evolution strategies) and p m = 1/n (genetic algorithms), with n denoting

As you have learned during the lecture, threshold units are the simplest neural networks: depend- ing on whether the netinput h i is below zero or not, the unit’s output is a “0”

Please note that the given code material does not provide any backpropagation func- tionality but demonstrates how to use the network functions. You might want to start with a