The Traveling Salesmens Problem
The Travelling Salesman Problem (TSP) is the challenge of finding the shortest yet most efficient route for a person to take given a list of specific destinations. ... The problem can be solved by analyzing every round-trip route to determine the shortest one .
With 15 destinations, the number of possible routes could exceed 87 billion. This is impossible to program with normal programming with "if..then..else" Therfore we use AI.
The best way to do this is to use Artificial Intelligence and Genetisk programmering.
This means that you create a motherprogram that creats childrenprograms where everyone shall solve the same problem. The 2 one that makes the best shall create a new "child" that has enherrit their parents DNA = Way thrue the map. This way will cretate better chldren. Better ways on the map.
This is a link to an explanation for the problem
Min video
This is a rar program that you has to onpack with a RAR or ZIP program.
rajo6se@yahoo.se
© Copyright. All Rights Reserved Mikrobin.se