Traveling Salsman Problem (recursive)
If anyone is fairly familiar with this problem I would appreciate the help.. My java file as of now reads it a .dat file containing 128 cities with their distances from one another. My goal for this is to be able to first computer a "path" to all cities and back to the original city. This is called the greedy method. If I get this greedy patch I can use it to be compared to a shortest path method to find the shortest TSP.
So if anyone knows anything about recursive TSP "greedy method only" please help me out. The cities i have are stored in an String array cityList[128] and the distances are stored as int 2D array distances[128][]. (as you can see the distances are only stored as row 0 having 1 element row 1 having 2 elements row 2 having 3 elements ect.
[782 byte] By [
Mykullski] at [2007-11-20 11:44:55]
# 1 Re: Traveling Salsman Problem (recursive)
Google for it, there's loads of help available online.
keang at 2007-11-10 2:14:02 >
# 2 Re: Traveling Salsman Problem (recursive)
thankssss....not (im sorry but thats a bs answer) i tried googling it and nothing was their that suited what i needed
# 3 Re: Traveling Salsman Problem (recursive)
thankssss....not (im sorry but thats a bs answer) i tried googling it and nothing was their that suited what i neededIf you think saying sorry while being rude to someone is going to make them feel more like helping you, you're sadly mistaken. As the old saying goes, "They may forget what you said, but they'll never forget how you made them feel".
If you really tried searching and could find nothing there to help you, either your problem is totally unique and we won't be able to help you anyway, or you don't really know what you're looking for, or you don't know how to use search engines effectively.
Whichever, your problem is finding a travelling salesman algorithm. This is a Java forum, not an algorithm forum. When you have found an algorithm and you get stuck coding it in Java, please return and we'll try to help you with your Java problem (although some of us may not be that interested given your last post).
The truth is, when all is said and done, one does not teach a subject, one teaches a student how to learn it. Teaching may look like administering a dose, but even a dose must be worked on by the body if it is to cure. Each individual must cure his or her own ignorance...
J Barzun
dlorde at 2007-11-10 2:16:04 >
# 4 Re: Traveling Salsman Problem (recursive)
I know that is called the "Traveling Salesman Problem (recursive)" and I got about 178.000 result at google...
Post what you got and point out where you need help. But, please don't post your home assigment and expect others do it for you. That is BS.
-petter
# 5 Re: Traveling Salsman Problem (recursive)
im not asking anyone to write code just help me what to think of... and im sorry i searched through google for along time and nothing i found is what i needed
# 6 Re: Traveling Salsman Problem (recursive)
(although some of us may not be that interested given your last post).
Due to his responses and shows of appreciation in several previous threads, I've given up trying to help him a while ago.
# 7 Re: Traveling Salsman Problem (recursive)
thankssss....not (im sorry but thats a bs answer)You asked a general question about a problem and so you got a general and valid answer. You didn't specify what actually "suited your needs" so how was I to know what constituted a suitable answer for you. And this is the second time you've been rude to someone who answered one of your posts so I suggest you rapidly rethink your attitude or you won't be getting any replies at all.
keang at 2007-11-10 2:20:03 >
