Brennan Cain

Computer Engineering Student and Robotics Researcher

Genetic Algorithm for Traveling Salesperson Problem

I decided to revisit an old problem from my junior year artificial intelligence class. My final project was a genetic algorithm to find a non-optimal solution to a Traveling Salesperson scenario. This is not complete as it is not guarenteed to give an optimal solution in any run time, but it gives a reasonable route through given points. In the future, I would like to revisit this problem in C++ with an adjacency graph rather than contantly recalculated euclidian points.
Previous Article
Next Article

Leave a Reply

Your email address will not be published. Required fields are marked *.

You may use these <abbr title="HyperText Markup Language">HTML</abbr> tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>