Section H (genetic algorithm)

This section looks at the use of Genetic Algorithms to mimic group behaviour. It is a form of Reinforcement Learning.

Section H: Unit #1 Steering

Let’s get a vehicle and start steering it

Section H: Unit #2 More Vehicles

Making lots of vehicles and giving them food

Section H: Unit #3 The Genetic Algorithm

This is where we introduce the Genetic Algorithm to the vehicles

Section H: Unit #4 The Travelling Salesperson 

The travelling Salesperson (TSP) is a famous mathematic challenge. Using GA to solve it (nearly), starting by getting the distance.

Section H: Unit #5 TSP Lexicographical Order (part 1)

Using Lexicographical Order to put the cities in order

Section H: Unit #6 TSP Lexicographical Order (part 2)

Continuing to develop the optimisation of the distance to the cities

Section H: Unit #7 TSP Genetic Algorithm

Now to use the power of the Genetic Algorithm to solve this unsolvable problem

Section H: Unit #8 TSP Crossover

The final bit of the jigsaw, utilising the better bits to create the best bit