Comments on: Tackling the travelling salesman problem: introduction http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/ folding with my brain Wed, 10 Feb 2010 09:47:52 +0000 http://wordpress.org/?v=2.9.2 hourly 1 By: Resolve TSP (Traveling Saleman Problem) in Genetic Algorithm « Zhanggw's Blog http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-10429 Resolve TSP (Traveling Saleman Problem) in Genetic Algorithm « Zhanggw's Blog Sat, 07 Nov 2009 15:03:11 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-10429 [...] http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/ [...] [...] http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/ [...]

]]> By: john http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-10046 john Mon, 09 Feb 2009 11:07:52 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-10046 Hi Ray, I know there's a bug in later versions of my code, as I don't open the output file in binary mode, but that only leads to image corruption on Windows. A file does show up. What does your code look like? Do you have PIL installed ok? Maybe you're writing the file to the wrong place and just not seeing it? Do you get any other errors? cheers, John Hi Ray,

I know there’s a bug in later versions of my code, as I don’t open the output file in binary mode, but that only leads to image corruption on Windows. A file does show up.

What does your code look like? Do you have PIL installed ok? Maybe you’re writing the file to the wrong place and just not seeing it? Do you get any other errors?

cheers,

John

]]> By: Ray http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-10045 Ray Sun, 08 Feb 2009 23:27:06 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-10045 I'm having trouble generating the image file. I'm new to python and studying your code. Is there something I should be entering into the code to correctly write the image? I've tried on linux and windows with no results. Everything runs but nothing appears to the file path I assign. I’m having trouble generating the image file. I’m new to python and studying your code. Is there something I should be entering into the code to correctly write the image? I’ve tried on linux and windows with no results. Everything runs but nothing appears to the file path I assign.

]]> By: eric casteleijn http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-10028 eric casteleijn Thu, 22 Jan 2009 13:44:30 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-10028 I've recently worked on a solution to a simplified version of TSP, which only requires that each city be visited once (i.e. no round-trip.) For which I think I found a solution. (I only needed it to create an optimal playlist, given acoustic distance scores between music files.) What I did was: connect the two cities with the lowest distance, then connect the two with the next lowest distance *unless* either of them is already in the middle of another chain. When two chains have a common end/begin city, join them together at that point. Continue until all cities are connected. The code for this can be found here: http://code.google.com/p/autoqueue/source/browse/trunk/mirage_miximize.py I'll be reading the upcoming entries with interest, thanks! I’ve recently worked on a solution to a simplified version of TSP, which only requires that each city be visited once (i.e. no round-trip.) For which I think I found a solution. (I only needed it to create an optimal playlist, given acoustic distance scores between music files.)

What I did was: connect the two cities with the lowest distance, then connect the two with the next lowest distance *unless* either of them is already in the middle of another chain. When two chains have a common end/begin city, join them together at that point. Continue until all cities are connected.

The code for this can be found here:

http://code.google.com/p/autoqueue/source/browse/trunk/mirage_miximize.py

I’ll be reading the upcoming entries with interest, thanks!

]]> By: john http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-6650 john Tue, 11 Mar 2008 15:58:18 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-6650 Hi Sedat, You're more than welcome to study the code and articles I've got on my blog. I hope you find them useful. A lot of this should still be relevant even when coding in C++. If you have any particular questions please let me know. John Hi Sedat,

You’re more than welcome to study the code and articles I’ve got on my blog. I hope you find them useful. A lot of this should still be relevant even when coding in C++.

If you have any particular questions please let me know.

John

]]> By: sedat haklı http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-6644 sedat haklı Tue, 11 Mar 2008 14:03:59 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-6644 hello...now ım looking for a hill climbing codes for my graduation project.... can u help me ? ım studying with c++ ... if you help me ı ll be so thank to you..... hello…now ım looking for a hill climbing codes for my graduation project….
can u help me ?
ım studying with c++ …
if you help me ı ll be so thank to you…..

]]> By: Psychic Origami » Blog Archive » Tackling the travelling salesman problem: simmulated annealing http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-98 Psychic Origami » Blog Archive » Tackling the travelling salesman problem: simmulated annealing Thu, 28 Jun 2007 13:16:21 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-98 [...] is the third part in my series on the “travelling salesman problem” (TSP). Part one covered defining the TSP and utility code that will be used for the various optimisation algorithms [...] [...] is the third part in my series on the “travelling salesman problem” (TSP). Part one covered defining the TSP and utility code that will be used for the various optimisation algorithms [...]

]]> By: Justin George http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-59 Justin George Wed, 06 Jun 2007 06:51:41 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-59 http://illicittech.blogspot.com/2007/06/travelling-salesman-problem.html Some similar code in Haskell. I'm going to try to do the later pages, as well. http://illicittech.blogspot.com/2007/06/travelling-salesman-problem.html

Some similar code in Haskell. I’m going to try to do the later pages, as well.

]]> By: Psychic Origami » Blog Archive » Tackling the travelling salesman problem: prologue http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-29 Psychic Origami » Blog Archive » Tackling the travelling salesman problem: prologue Sat, 12 May 2007 18:07:49 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-29 [...] Defining the Travelling Salesman Problem (and writing shared utility code) [...] [...] Defining the Travelling Salesman Problem (and writing shared utility code) [...]

]]> By: Psychic Origami » Blog Archive » Tackling the travelling salesman problem: hill-climbing http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/comment-page-1/#comment-27 Psychic Origami » Blog Archive » Tackling the travelling salesman problem: hill-climbing Sat, 12 May 2007 13:56:58 +0000 http://www.psychicorigami.com/2007/04/17/tackling-the-travelling-salesman-problem-part-one/#comment-27 [...] is the second part in my series on the “travelling salesman problem” (TSP). Part one covered defining the TSP and utility code that will be used for the various optimisation algorithms [...] [...] is the second part in my series on the “travelling salesman problem” (TSP). Part one covered defining the TSP and utility code that will be used for the various optimisation algorithms [...]

]]>