filmov
tv
Genetic Algorithm VS Travelling Salesman Problems
Показать описание
Genetic Algorithm solves various Travelling Salesman Problems.
Took about ~4 hours to compute 5000 generations each for 24 problems.
Every peak that is show is the algorithm completely converging upon a solution (all individuals are the same solution) and then broadening the search area.
The search area is the number of cites squared. Every four problems the number of cities increases by 5, starting at 10.
00:00 10 Cities
00:12 15 Cities
00:36 20 Cities
01:16 25 Cities
02:26 30 Cities
03:33 35 Cities
Took about ~4 hours to compute 5000 generations each for 24 problems.
Every peak that is show is the algorithm completely converging upon a solution (all individuals are the same solution) and then broadening the search area.
The search area is the number of cites squared. Every four problems the number of cities increases by 5, starting at 10.
00:00 10 Cities
00:12 15 Cities
00:36 20 Cities
01:16 25 Cities
02:26 30 Cities
03:33 35 Cities
0:19:39
0:11:52
0:05:18
0:00:57
0:01:00
0:09:06
0:16:43
0:00:09
1:01:03
0:00:22
0:04:01
0:00:46
0:30:27
0:00:45
0:07:43
0:13:18
0:30:09
0:52:26
0:12:03
0:07:45
0:01:15
0:29:20
0:04:56
0:00:43