traveling sailsman probelm

[ramone]

sailsman problem

hello do you know about the travelibg sailsman problem??? If anyone has any info to give please upload...

 

[sezaidi]

Can you provide some more detail regarding why do you need the information then may be I can help.

Regards,

\\sezaidi

 

[asit]

Matlab has a demo on Traveling Salesman problem.

 

[checkmate]

Given a graph of nodes, and the connections between them (each connection has an associated cost), what is the fastest way to traverse through all the nodes? This problem is unique in that there is no known optimal solution other than the obvious solution of finding all paths and computing the one with the minimum cost. Such a problem is known as an NP-Hard problem.

It is popular as it can be used to benchmark the various search algorithms in AI.

 

[StefB]

There is some nice research about how ANTS solve the traveling salesman problem...

**broken link removed**
http://www.heise.de/kiosk/archiv/ct/2005/5/204
http://www.abendblatt.de/daten/2004/04/27/288418.html

 

[banh]

this is still open problem.
you can come up with algorithm of your own.
no best optimum solution so far.

 

[sezaidi]

Re: traveling sellsman probelm

Informal description is not enough.

The person who post the first message should clearly mention the intentions and the possible areas in which he/she wants the Travelling Salesman Problem to be apply.

It is a whole theory known as "Computational Complexity of Algorithms" and Theory of NP-Completeness etc.

If objectives are clearly mentioned then some can help which would be useful.

Regards,

\\sezaidi

 

[ramone]

To be more clear i must say that i'm starting a project to program 4 robots in order they can co-operate and find a target in an unknown area with an optimum algorithm (plus robots must avoid obstacles and reprogram their path). I'm starting with the simplest problem that 2 robots start in an known space but they don't know where the target is... They can move one step ahead and they must find the best 2 paths in order to search the whole area in the minimum time....

I would be glad if you know could help me a little more...


Thanks in advance!

 

[lovebug]

hi man
i had worked over genetic algorithm.And this algorithm is used to slove the travelling sales man problem i.e a salesman has to travel diffrent cities in such a manner that he takes the optimum path.
so u can use the matlab toolbox available for genetic algorithm on university of Sheffield site to solve the traveling salesman problem.

 

[iffi84]

check this link a very easy to understand description of TSP is given

https://en.wikipedia.org/wiki/Traveling_salesman_problem#Problem_statement

 

[tjr]

u can get this problem in Artificial intelligence of TMH publications

 

[hitx]

Hi everybody.I really need a matlab codes of solution of "Travelling Salesman Problem".This is my important homework.Please my all friends, if anybody knows or has this codes please send to me.
I will be pleased. I am waiting a response. Thanks a lot.
Hitx
e mail : hitx_47@hotmail.com

 

[VSWR]

Here:

**broken link removed**