41. Re: Fastest Route Around The U.S.? - Rec.travel.usa-canada(307757) http//en.wikipedia.org/wiki/traveling_salesman_problem. It turns out to be a very tough problem, and for 50 states may be intractable. http://www.national-anthems.net/forum/article/rec.travel.usa-canada/307757

National Anthems: Home Africa Americas Asia ... Olympic Anthem Enter your search terms Submit search form Web www.national-anthems.net Passports: Home Africa Asia Europe ... Other documents Travel: [Europe] [ Asia ] [ USA-Canada ] [ Latin-America ... [ Newest Article ] Re: Fastest Route Around the U.S.? Posted on: Mon, 16 Oct 2006 13:30:19 EDT On Sat, 14 Oct 2006 23:45:44 -0400, pltrgyst wrote: >On Sat, 14 Oct 2006 14:18:10 -0500, rrudd >wrote: >>I've been thinking about creating my own curriculum, complete with >>video footage from each state on DVD. I'm contemplating taking a year >>off from teaching and travelling to all 50 states in one year (one week >>per state). >>Does anyone know of a place to find the *-quickest-* path around the >>country, with Dallas/Fort Worth as a starting point? >First, define exactly where you want to go the 50 state capitals? >That algorithm will be quite different from one that simpy enters all 50 states. It's called The Traveling Saleman's problem, and you can google for just that, which give you, e.g.

42. Math Forum Discussions Salesman Problem (http//en.wikipedia.org/wiki/ traveling_salesman_problem). Matlab has a demo that solves this problem via heuristic procedures. http://mathforum.org/kb/thread.jspa?threadID=1562421&messageID=5671762

43. Ksl.com - UPS Drivers Discouraged From Making Left Turns In fact, it is classified as NPhard (http//en.wikipedia. org/wiki/traveling_salesman_problem). I infer from the article that the UPS routing software http://www.ksl.com/index.php?nid=148&sid=360685&comments=true

44. C++ Help [Archive] - Xtreme Visual Basic Talk mean the Traveling Salesman Problem. Not sure, since you said problem again, which is redundant. http//en.wikipedia.org/wiki/traveling_salesman_problem http://www.xtremevbtalk.com/archive/index.php/t-261671.html

Xtreme Visual Basic Talk Other Languages Miscellaneous Languages PDA View Full Version : C++ help Help someone 05-07-2006, 06:41 PM Hello, I am trying to generate all the possible random paths possible for the TSP problem. But I am getting an error. But I get an error message:.... line no: 22 error: invalid types int[int] for array subscript. What is the error? I can't find it? using namespace std; //#define CITIES 3 int factorial(int n); int tours[6][3]; int i; int j; int tour = 0; int number = 0; j = 0; // These are handling the first column of every row. tour[i][0] = ;//= i/factorial( -1); int factorial(int n) int i; int product; product = 1; product = product * i; return product; 05-07-2006, 07:13 PM tours, not tour. :p Help someone 05-07-2006, 07:14 PM Oh! Thanks! Why didn't I see that? Help someone 05-07-2006, 08:09 PM Do you have any advice on how to generate all the possible paths possible for a TSP problem? I would like to implement a function for the brute force attack on the TSP , that is, generate all the possible paths and then compute the length of each path and then choose the best one. 05-07-2006, 09:54 PM

45. CodeGuru Forums - TSP Algorithm For 1000 Cities Have you looked at this link (http//en.wikipedia.org/wiki/traveling_salesman_problem) ? It contains a handful of exact heuristic methods for the TSP http://www.codeguru.com/forum/archive/index.php/t-413865.html

CodeGuru Forums General Discussion PDA Click to See Complete Forum and Search > TSP Algorithm for 1000 cities ster February 5th, 2007, 02:21 PM Hello.. I have to solve TSP for about 1000 cities in maximum 10 secs...! I 'm thinking of using a liner programming-based algorithm (haven't chosen exactly yet), but I don't know if he well be sufficient.. What do you think? Zachm February 6th, 2007, 05:13 AM Have you looked at this link (http://en.wikipedia.org/wiki/Traveling_salesman_problem) ? Personally, I don't think that any of the exact methods will suffice your time constraint (10 sec), maybe try a heuristic method like GA or Adaptive Simulated Annealing ? One more thing: have you considered parallel computation ? it might boost your computation time. Best of luck ! ster February 6th, 2007, 08:59 AM Thanx for the reply. Yeah, I 've checked this out. Actually, this is were i started from. :) Ok, I 'll study both GA (Genetic Algorithms i suppose) and the Adaptive Simulated Annealing thing. Hope i choose the appropriate soon... I 'm also thinking of bying this one...

46. [QUIZ] Itinerary For A Traveling Salesman (#142) - ReadList.com http//en.wikipedia.org/wiki/traveling_salesman_problem http//en.wikipedia.org/wiki/Genetic_algorithm. PrevMsg, Prev-Thread. Home. Ruby-talk, Oct-2007 http://readlist.com/lists/ruby-lang.org/ruby-talk/18/91521.html

Prev-20 Home Next-20 3 msg ... finding obscure documentation [QUIZ] Itinerary for a Traveling Salesman (#142) Ruby Quiz (5 Oct 2007) Simon Kröger (6 Oct 2007) James Edward Gray II (6 Oct 2007) Morton Goldberg (6 Oct 2007) Eric Mahurin (6 Oct 2007) James Edward Gray II (6 Oct 2007) Morton Goldberg (7 Oct 2007) Dave Pederson (7 Oct 2007) James Edward Gray II (8 Oct 2007) Martin DeMello (8 Oct 2007) steve d (7 Oct 2007) James Edward Gray II (7 Oct 2007) James Koppel (7 Oct 2007) James Edward Gray II (7 Oct 2007) James Koppel (7 Oct 2007) Eugene Kalenkovich (8 Oct 2007) Joseph Seaton (8 Oct 2007) Eric I. (9 Oct 2007) Morton Goldberg (9 Oct 2007) steve (10 Oct 2007) James Edward Gray II (10 Oct 2007) Morton Goldberg (10 Oct 2007) Ruby Quiz (11 Oct 2007) 2 msg Sizeof(Object) 2 msg Mechanize click button ... Next-20 Prev-Msg Prev-Thread Home Ruby-talk Oct-2007 ... Next-Msg Subject: [QUIZ] Itinerary for a Traveling Salesman (#142) Group: Ruby-talk From: Ruby Quiz Date: 5 Oct 2007 The three rules of Ruby Quiz: 1. Please do not post any solutions or spoiler discussion for this quiz until 48 hours have passed from the time on this message.

47. The Chronicles Of George :: Search Being the IT department for a bunch of travelling salesmenYeah, but have you solved url=http//en.wikipedia.org/wiki/traveling_salesman_problemtheir http://cog.nanc.com/board/search.php?search_author=dakboy&sid=1c76fb994ad971c41b

48. Groundspeak Forums [Powered By Invision Power Board] Generating a http//en.wikipedia.org/wiki/traveling_salesman_problem is complex math problem, and most software does not attempt it. http://forums.groundspeak.com/GC/index.php?act=Print&client=printer&f=11&t=18008

49. Sci.math.research 2=BDD _convex_hull/pseudotraveling_salesman_problem?=. From Olumide Date 4/14/2007 30010 PM. Hi - I d appreciate any suggestions or references on that http://www.clubusenet.com/thread/5024381.html

50. Processing Blogs » 2008 » February Genetic Algorithm classes http//www.heatonresearch.com Travelling Salesman http//en.wikipedia.org/wiki/traveling_salesman_problem. Cast Ryan Bateman http://www.processingblogs.org/2008/02/page/5/

del.icio.us flickr all manner of distractions " Blog Archive " Ink trails Processing 1.0 (BETA) - Ruby-Processing Ray Tracing and Photon Mapping Create Digital Motion " Processing Journal: OpenGL Headaches, JMyron Motion Tracking and Video Capture Experiences ... Thinking Machine 4: Play the Game Archive for February, 2008 Peter Kirn R.E.M. Open Sources Music Videos; Will VJs Go Legally Legit? R.E.M., by Dunechaser . And Lego. There are some serious, high-profile indications that big artists are beginning to embrace alternative licensing for their content, whether it’s pay-what-you-wish distribution, “please remix this for us” marketing campaigns, or genuinely open content. Whether that’s just a brief fad or the sign of things to come, it’s too early to say. But R.E.M. have at least uploaded a full eleven videos, nicely encoded in MPEG4, under an open source license: Supernatural Serious Album Page, with vids R.E.M. Releases New Videos Under Open Source License [ReadWriteWeb, via vade] R.E.M. aside, I wonder: will at least some VJs embrace open content, perhaps even exclusively? Now, this isn’t without caveats:

51. Where Are You Based? - Page 28 - Cycle Chat I was just wondering (a bit geeky, I know) how bonj would solve the traveling salesman problem (http//en.wikipedia.org/wiki/traveling_salesman_problem) http://www.cyclechat.co.uk/forums/showthread.php?p=176473

52. Path News.mathworks.com!newsfeed-00.mathworks.com!newsfeed2 cycle with the smallest distance, you will need to solve the Traveling Salesman Problem (http//en.wikipedia.org/wiki/ traveling_salesman_problem). http://www.mathworks.fr/matlabcentral/newsreader/view_original/369256

Path: news.mathworks.com!newsfeed-00.mathworks.com!newsfeed2.dallas1.level3.net!news.level3.com!postnews.google.com!b40g2000prd.googlegroups.com!not-for-mail From: "J.N." <joao.natali@gmail.com> Newsgroups: comp.soft-sys.matlab Subject: Re: Polygon drawing Date: 26 Apr 2007 08:54:27 -0700 Organization: http://groups.google.com Lines: 31 Message-ID: <1177602867.779659.84460@b40g2000prd.googlegroups.com> References: <ef54a49.-1@webcrossing.raydaftYaTP> NNTP-Posting-Host: 24.46.78.18 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Trace: posting.google.com 1177602876 18804 127.0.0.1 (26 Apr 2007 15:54:36 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 26 Apr 2007 15:54:36 +0000 (UTC) In-Reply-To: <ef54a49.1@webcrossing.raydaftYaTP> User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.1.3) Gecko/20070309 Firefox/2.0.0.3,gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: b40g2000prd.googlegroups.com; posting-host=24.46.78.18; Xref: news.mathworks.com comp.soft-sys.matlab:405419 On Apr 26, 2:54 am, Ash <ashp...@gmail.com> wrote: > thank you J.N > Tried what you suggested. > But seems only the first and last points join. > The rest is still a zig zag scan, the way MATLAB reads it > But i will try again > Thanks > > For instance, assuming n points. > > A = [ zeros(n-1,1) , eye(n-1) ; 1 , zeros(1,n-1) ] ; > > gplot(A,[x,y]) ; Hi, Ash, the code above assumes that the coordinate points are previously ordered (each point, or node, connects to the following one in the list). If that's not the case and you want to define the (non-crossing) cycle with the smallest distance, you will need to solve the Traveling Salesman Problem (http://en.wikipedia.org/wiki/ Traveling_salesman_problem). Matlab has a demo that solves this problem via heuristic procedures. Check http://www.mathworks.com/support/solutions/files/s37739/traveling_salesman_demoR13.m Regards, J.N.

53. PLZ HELP! Mathematics(TSP)! http//en.wikipedia.org/wiki/traveling_salesman_problem Last edited by checkmate on 16 Aug 2005 1900; edited 1 time in total http://www.edaboard.com/ftopic129844.html

Recent posts topic RSS Search Register ... Elementary Electronic Questions Author Message ramone Joined: 05 Oct 2003 Posts: 55 Location: Patras University 16 Aug 2005 13:13 PLZ HELP! Mathematics(TSP)! Hi there! I'm working on some robotics and i use the Traveling Salesman Problem to make some paths. At the moment i'm trying to model this game: the salesman starts from a city (say 1) and has n cities to travel but he has only T time units. Assuming that every travel between 2 cities is one time unit then which is the best path to take? This means i have to reformulate the problem in some way. I have thought of a solution but how can i gurrante if it is the optimal or not? What maths to use? Back to top checkmate Joined: 26 Feb 2004 Posts: 489 Helped: Location: Toilet Seat 16 Aug 2005 14:53 Re: PLZ HELP! Mathematics(TSP)! The TSP problem is a well-known NP hard problem. While the optimal path can be found in reasonable time for small N, this proves difficult for large N, where the search focuses on suboptimal paths. Wikipedia has a list of possible algorithms.

54. Re: A Possible "solution" To The Halting Problem The problem nomenclature is just the same as is used in the Travelling Salesman Problem. en.wikipedia.org/wiki/traveling_salesman_problem The halting http://www.archivum.info/comp.theory/2006-10/msg00201.html

comp.theory Top All Lists Date Enter your search terms Submit search form Web www.archivum.info Thread Re: A Possible "solution" to the Halting Problem from [ Alan Smaill Subject Re: A Possible "solution" to the Halting Problem From Date Wed, 18 Oct 2006 10:46:48 +0100 Newsgroups comp.theory sci.logic http://www.cprogramming.com/tutorial/computersciencetheory/halting.html Are you saying that the root cause of the "Problem" aspect of the "Halting Problem" has nothing to do with self-reference? The "problem" nomenclature is just the same as is used in the Travelling Salesman Problem. en.wikipedia.org/wiki/Traveling_salesman_problem The halting problem, just as with the TSP, is well-posed and unambiguous. Alan Smaill More with this subject... Current Thread Re: A Possible "solution" to the Halting Problem (continued) Re: A Possible "solution" to the Halting Problem Peter Olcott Re: A Possible "solution" to the Halting Problem Patricia Shanahan Re: A Possible "solution" to the Halting Problem

55. Traveling Salesman Problem en.wikipedia.org/wiki/traveling_salesman_problem. The traveling salesman problem or travelling salesman problem (TSP), also known as the traveling http://www.edefinition.in/a/traveling salesman problem.html

Enter your search terms Submit search form edefinition.in Web definitions > traveling salesman problem Related Phrases: problem solving traveling salesman problem halting problem health problem flatness problem y2k problem agency problem problem child story problem satisfiability problem Definitions of Traveling salesman problem www.geocities.com/CapeCanaveral/1224/terms/esri_gloss.html This is a classic tour problem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each. en.wikipedia.org/wiki/Traveling_salesman_problem The traveling salesman problem or travelling salesman problem (TSP), also known as the traveling salesperson problem,is a problem in discrete or combinatorial optimization. It is a prominent illustration of a class of problems in computational complexity theory which are hard to solve. www.esse.ou.edu/glossary_st.html A classic problem in operations research; the objective is to find the shortest path a "traveling salesman" could follow in order to visit each of a set of geographically distributed locations. Alpha numeric search: A B C D ... Z

56. Loading Several Hundred Addresses Into GPS http//en.wikipedia.org/wiki/traveling_salesman_problem I don t know of a GPS that can plan your trip, I m sorry. /Mogens http://www.n-n-a.com/science/about2851.html

Navigation: Main Page Computer Recreational Science ... Television Web N-N-A.com Loading.. Science Groups Forum Index Geology - Satellite Navigation Page of Author Message solarity Posted: Tue Sep 19, 2006 2:11 am Guest We regularly have a need to "hit the road' and inspect 100 to 400 local real estate properties. Getting to these local properites in the most efficient manner is a big deal to us. Is anyome aware of a portable GPS that would allow us to "download" via bluetooth or usb a long list of addresses and have the GPS sort then into the most efficient order given a specific starting point? Thanks a bunch!! Back to top Mogens Beltoft Posted: Tue Sep 19, 2006 2:17 am Guest solarity wrote: Quote: We regularly have a need to "hit the road' and inspect 100 to 400 local real estate properties. Getting to these local properites in the most efficient manner is a big deal to us. Is anyome aware of a portable GPS that would allow us to "download" via bluetooth or usb a long list of addresses and have the GPS sort then into the most efficient order given a specific starting point? Thanks a bunch!!

57. ID2401,visited_hrefs,5,d,25 page 202 http//en.wikipedia.org/w/index.php?title=Optimal_routing_problem action= edit. page 203 http//en.wikipedia.org/wiki/traveling_salesman_problem http://128.111.69.4/~jevbratt/infome_imager/lite/crawler_files/interface/display

58. Traveling Salesman Problem: ZIP-Method - Http://www.jochen-pleines.de/sprachen/e Sport Music Health Arts Computing House Games Economy Sexy Sport V1. audit et mesure d audience visiteurs internet par Analyse d audience http://sciences.jdmag.net/dir/Math/Operations_Research/Traveling_Salesman_Proble

SCIENCE Sport Music Health SCIENCE Sport Music Health ... audit et mesure d'audience visiteurs internet par

59. Issihk.com - Salesman en.wikipedia.org/wiki/traveling_salesman_problem 59k - Cached - Similar pages Sales - Wikipedia, the free encyclopedia forms a separate grouping in a http://www.issihk.com/hot-products/salesman/

Salesman Salesman (1969) Salesman on IMDb: Movies, TV, Celebs, and more... ... Plot Outline: Four relentless door-to-door salesmen deal with constant rejection, homesickness and ... www.imdb.com/title/tt0064921/ - 44k - Cached - Similar pages Confessions of a Car Salesman Finally, we came up with the idea of hiring an investigative reporter to work in the industry and experience, firsthand, the life of a car salesman. ... www.edmunds.com/advice/buying/articles/42962/article.html - 32k - Cached - Similar pages Confessions of a Car Salesman As I passed I would look over at the row of salesmen standing in front of the ... the salesman asked, seeking common ground, a way to relax me before ... www.edmunds.com/advice/buying/articles/42962/page001.html - 47k - Cached - Similar pages Traveling Salesman Problem Traveling Salesman Problem. >> QSopt Linear Programming Solver The executable versions of the Concorde TSP code (including the Windows GUI) are built with ... www.tsp.gatech.edu/ - 6k - Cached - Similar pages SparkNotes: Death of a Salesman Home : English : Literature Study Guides : Death of a Salesman. Death of a Salesman. - Navigate Here -, Context, Plot Overview, Character List ...

60. Search - Site - Jack Baskin School Of Engineering, UC Santa Cruz http//wikitrust.cse.ucsc.edu/index.php/traveling_salesman_problem kolaitis@cs.ucsc.edu (with C.H. Papadimitriou),. Journal of Computer and System Sci- . http://www.soe.ucsc.edu/site/search.html?query=papadimitriou

Page 3     41-60 of 73    Back | 1  | 2  | 3  | 4  | Next 20