WEBVTT
Kind: captions
Language: en

00:00:14.680 --> 00:00:19.480
Finally we can see some applications of Genetic algorithm.

00:00:19.800 --> 00:00:26.140
Genetic algorithm can be applied to find the maximum or minimum of a function.

00:00:26.740 --> 00:00:28.400
We can see this example.

00:00:28.980 --> 00:00:31.800
We wan to find the maximum of this function.

00:00:32.260 --> 00:00:37.540
However, it is difficult for some optimization strategies

00:00:38.020 --> 00:00:43.840
such as hill climbing techniques because of its oscillation.

00:00:44.540 --> 00:00:45.860
In the case,

00:00:46.300 --> 00:00:50.180
we can use genetic algorithm to solve the problem.

00:00:50.680 --> 00:00:57.420
We can see that genetic algorithm can find the maximum of the function as shown here.

00:00:58.040 --> 00:00:59.820
With some modification,

00:01:00.060 --> 00:01:05.020
genetic algorithm can also solve the Traveling salesman problem

00:01:05.460 --> 00:01:11.760
that a salesman has to visit all the cities with shortest path.

00:01:12.300 --> 00:01:15.720
Furthermore, genetic algorithm can be applied to

00:01:16.600 --> 00:01:20.840
automotive design, robotics, etc.