Difference between revisions of "User:Alixouazana"
Alixouazana (talk | contribs) |
Alixouazana (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 14: | Line 14: | ||
Favorite MATLAB demonstration: The Travelling Salesman Problem | Favorite MATLAB demonstration: The Travelling Salesman Problem | ||
| − | The Traveling Salesman problem is able to solve how to find the shortest path through a set of different cities. This is my favorite demonstration because it is able to load different cities | + | The Traveling Salesman problem is able to solve how to find the shortest path through a set of different cities. This is my favorite demonstration because it is able to load data of different cities, check if cities are inside a specific border, and even draw that border. After calculating the number of possible trips, the trip distances, and the number of subtours, it returns a map with borders, cities (stops), but mostly with the path that answers the problem. I find it incredible that such a program can be run on MATLAB. |
Latest revision as of 04:20, 19 September 2017
Alix Ouazana
17 years old
From Paris, France
Currently a Student at Duke University in the Pratt School of Engineering and part of the Class of 2021
Article on a Grand Challenge of Engineering:
U.S. at risk of cyberattacks, experts say, Brandon Griggs, CNN, updated 18 August 2008, accessed 18 September 2017 (Secure Cyberspace)
Favorite MATLAB demonstration: The Travelling Salesman Problem
The Traveling Salesman problem is able to solve how to find the shortest path through a set of different cities. This is my favorite demonstration because it is able to load data of different cities, check if cities are inside a specific border, and even draw that border. After calculating the number of possible trips, the trip distances, and the number of subtours, it returns a map with borders, cities (stops), but mostly with the path that answers the problem. I find it incredible that such a program can be run on MATLAB.
