# Matlab (TSP)

**URL:** <https://forum.kirupa.com/t/matlab-tsp/260698>\
**Category:** random\
**Created:** [May 19, 2008, 1:36am UTC](https://forum.kirupa.com/t/matlab-tsp/260698 "2008-05-19T01:36:06Z")\
**Posts on this page:** 4\
**Page:** 1

<div class="post-metadata">

**Author:** ![t0mm0](https://avatars.discourse-cdn.com/v4/letter/t/9d8465/32.png) [@t0mm0](https://forum.kirupa.com/u/t0mm0)\
**Post date:** [May 19, 2008, 1:36am UTC](https://forum.kirupa.com/t/matlab-tsp/260698/1 "2008-05-19T01:36:06Z")

</div>

I have an ITB assignment that requires me to create a GUI and program a solution to the TSP (Traveling salesman problem). I need a way to mathematically optimise the route. Anyone got any ideas?

---

<div class="post-metadata">

**Author:** ![krilnon](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/krilnon/32/34_2.png) [@krilnon](https://forum.kirupa.com/u/krilnon)\
**Post date:** [May 19, 2008, 2:56am UTC](https://forum.kirupa.com/t/matlab-tsp/260698/2 "2008-05-19T02:56:10Z")

</div>

“New” ideas, or just ideas? I doubt that anyone is going to respond with a solution that’s better than the ones that have already been found: [http://en.wikipedia.org/wiki/Traveling\_salesman\_problem](http://en.wikipedia.org/wiki/Traveling_salesman_problem)

---

<div class="post-metadata">

**Author:** ![anon1712571](https://avatars.discourse-cdn.com/v4/letter/a/9dc877/32.png) [@anon1712571](https://forum.kirupa.com/u/anon1712571)\
**Post date:** [May 19, 2008, 2:24pm UTC](https://forum.kirupa.com/t/matlab-tsp/260698/3 "2008-05-19T14:24:06Z")

</div>

[http://del.icio.us/search/?fr=del\_icio\_us&p=TSP&type=all](http://del.icio.us/search/?fr=del_icio_us&p=TSP&type=all)

---

<div class="post-metadata">

**Author:** ![icio](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/icio/32/484_2.png) [@icio](https://forum.kirupa.com/u/icio)\
**Post date:** [May 19, 2008, 5:38pm UTC](https://forum.kirupa.com/t/matlab-tsp/260698/4 "2008-05-19T17:38:09Z")

</div>

> **[Travelling salesman problem](https://en.wikipedia.org/wiki/Traveling_salesman_problem)**
>
> The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP. In the theory of computational complexity, the deci...