"If you were ploughing a field, which would you rather use? Two strong oxen or 1024 chickens?"
-- Seymour Cray (1925 - 1996)
We can condense the contents of the previous section into a more formal and terse form by saying that...
We can use this list as a basis for a computer based model of evolution which we can use to breed solutions to other problems. To do this we need the following four building blocks. I have used the school timetabling example from section 1 to help illustrate their purpose...
Once we have this simple set of building blocks we will be ready to implement the evolutionary algorithm, which is essentially the loop illustrated in figure 4.
fig. 4: Evolutionary Algorithm
The next section gives an introduction to the Travelling Salesman Problem (TSP), which we will use to help illustrate the application of EAs to simple problems. Then, the following few sections give details of how we can implement the above algorithm and the associated building blocks in Delphi, to solve the TSP. Since Delphi is a pretty complete object oriented language it should be fairly simple to translate the code as you see fit (into C++ for example...).
| Back |
|
|
| Contents | ||
| Next | ||