<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments for G E B W E B</title>
	<link>http://gebweb.net</link>
	<description>Striking fear into the hearts of the wicked!</description>
	<pubDate>Sun, 01 Aug 2010 00:53:36 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2</generator>

	<item>
		<title>Comment on A Fastest Roundtrip Finder for Google Maps by Storage Glossop</title>
		<link>http://gebweb.net/blogpost/2007/07/03/a-fastest-roundtrip-finder-for-google-maps/#comment-412</link>
		<author>Storage Glossop</author>
		<pubDate>Tue, 13 Jul 2010 09:52:06 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/03/a-fastest-roundtrip-finder-for-google-maps/#comment-412</guid>
		<description>How long do you spend a day coming up with stuff like this?</description>
		<content:encoded><![CDATA[<p>How long do you spend a day coming up with stuff like this?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Fastest Roundtrip Finder for Google Maps by Self Storage Middleton</title>
		<link>http://gebweb.net/blogpost/2007/07/03/a-fastest-roundtrip-finder-for-google-maps/#comment-411</link>
		<author>Self Storage Middleton</author>
		<pubDate>Tue, 13 Jul 2010 09:51:14 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/03/a-fastest-roundtrip-finder-for-google-maps/#comment-411</guid>
		<description>Completely agree with your comments on this - thanks for taking the time to post.</description>
		<content:encoded><![CDATA[<p>Completely agree with your comments on this - thanks for taking the time to post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Doom-O-Meter by Davis30Kari</title>
		<link>http://gebweb.net/blogpost/2007/09/20/the-doom-o-meter/#comment-410</link>
		<author>Davis30Kari</author>
		<pubDate>Fri, 09 Jul 2010 00:43:17 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/09/20/the-doom-o-meter/#comment-410</guid>
		<description>If you are willing to buy real estate, you would have to get the &lt;a href="http://bestfinance-blog.com" rel="nofollow"&gt;loan&lt;/a&gt;. Furthermore, my mother all the time utilizes a secured loan, which seems to be the most firm.</description>
		<content:encoded><![CDATA[<p>If you are willing to buy real estate, you would have to get the <a href="http://bestfinance-blog.com" rel="nofollow">loan</a>. Furthermore, my mother all the time utilizes a secured loan, which seems to be the most firm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Optimize Your Trips by max</title>
		<link>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-409</link>
		<author>max</author>
		<pubDate>Sun, 04 Jul 2010 15:28:22 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-409</guid>
		<description>Can not figure out how to put in multiple address in radom order and get the most effecient route. Also need at the same time a map and written directions from point A to B to C etc.</description>
		<content:encoded><![CDATA[<p>Can not figure out how to put in multiple address in radom order and get the most effecient route. Also need at the same time a map and written directions from point A to B to C etc.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Optimize Your Trips by max</title>
		<link>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-408</link>
		<author>max</author>
		<pubDate>Sun, 04 Jul 2010 15:22:25 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-408</guid>
		<description>I can not figure out how to input multiple addresses and get the fast most efficient route. Also at the same time need map and written directions from starting point to the closest to the next closest etc.</description>
		<content:encoded><![CDATA[<p>I can not figure out how to input multiple addresses and get the fast most efficient route. Also at the same time need map and written directions from starting point to the closest to the next closest etc.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Behind the Scenes of OptiMap by Marc Fülöpp</title>
		<link>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-406</link>
		<author>Marc Fülöpp</author>
		<pubDate>Tue, 08 Jun 2010 22:07:08 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-406</guid>
		<description>Hi, I found this page via a link from wikipedia (TSP-article). Since I did some playing around with the Wolfram Mathematica demonstration notebook files regarding TSP-solving, which illustrate a lot of usefull insights for a first grip on this material quite nice, though somewhat static, I am wondering whether there would be any sane opportunities of solving the TSP of the following way points of a huge travel to asia that I'm planning throughout the next weeks and, if and then in which way one should/could incorporate the factors of visa regulations and "unforeseen incidents" within an attempt to solving it within mathematica - or however. Just let me illustrate this: My plan is to set out from Frankfurt/Germany, where I currently live and travel along an - in the wider sense - by TSP means OPTIMAL route, ideally also making use of the best possible airline and travel fares. I'm planning to do some [legal] volunteer work along and would like to encounter some great couchsurfing.com-related real life experiences :-) Perhaps providers of emergency roadside repair/roadside assistance services may have some great experience solving those kind of TSPs that I'm likely to run into - judging by general dynamics, visa/time windows, costs and all. Anyone betting on the power of mere intuition on solving this one?: THE ROUTE POINTS are, unless for Frankfurt/Germany as fixed starting point - in NO order at all, which is the route of this search for a route... -&#62; Singapore; Bangkok; Manila; Ho Chi Minh; Angkor Wat; Phnom Penh; Taipeh; Seoul; Brisbane; Sydney; Adelaide; Melbourne Australia; Wellington; Christchurch/New Zealand; Tokyo. I would greately value any hints given to let me get a better idea of how to solve this enormously complex TSP. Thank you very much. Marc</description>
		<content:encoded><![CDATA[<p>Hi, I found this page via a link from wikipedia (TSP-article). Since I did some playing around with the Wolfram Mathematica demonstration notebook files regarding TSP-solving, which illustrate a lot of usefull insights for a first grip on this material quite nice, though somewhat static, I am wondering whether there would be any sane opportunities of solving the TSP of the following way points of a huge travel to asia that I&#8217;m planning throughout the next weeks and, if and then in which way one should/could incorporate the factors of visa regulations and &#8220;unforeseen incidents&#8221; within an attempt to solving it within mathematica - or however. Just let me illustrate this: My plan is to set out from Frankfurt/Germany, where I currently live and travel along an - in the wider sense - by TSP means OPTIMAL route, ideally also making use of the best possible airline and travel fares. I&#8217;m planning to do some [legal] volunteer work along and would like to encounter some great couchsurfing.com-related real life experiences <img src='http://gebweb.net/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> Perhaps providers of emergency roadside repair/roadside assistance services may have some great experience solving those kind of TSPs that I&#8217;m likely to run into - judging by general dynamics, visa/time windows, costs and all. Anyone betting on the power of mere intuition on solving this one?: THE ROUTE POINTS are, unless for Frankfurt/Germany as fixed starting point - in NO order at all, which is the route of this search for a route&#8230; -&gt; Singapore; Bangkok; Manila; Ho Chi Minh; Angkor Wat; Phnom Penh; Taipeh; Seoul; Brisbane; Sydney; Adelaide; Melbourne Australia; Wellington; Christchurch/New Zealand; Tokyo. I would greately value any hints given to let me get a better idea of how to solve this enormously complex TSP. Thank you very much. Marc</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Behind the Scenes of OptiMap by Mission Foods</title>
		<link>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-403</link>
		<author>Mission Foods</author>
		<pubDate>Thu, 13 May 2010 19:01:32 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-403</guid>
		<description>I read your behind-the-scenes explanation of the Optimap and I must express that you are providing a great tool for small businesses all over.  I found out about your tool through a small business owner when he needed my coding expertise and I passed knowledge of this app to my supervisor.  I hope this app lands you many more opportunities if it has not already.</description>
		<content:encoded><![CDATA[<p>I read your behind-the-scenes explanation of the Optimap and I must express that you are providing a great tool for small businesses all over.  I found out about your tool through a small business owner when he needed my coding expertise and I passed knowledge of this app to my supervisor.  I hope this app lands you many more opportunities if it has not already.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Behind the Scenes of OptiMap by Geir</title>
		<link>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-398</link>
		<author>Geir</author>
		<pubDate>Fri, 07 May 2010 16:27:07 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-398</guid>
		<description>Hi Marc,

I have updated the text to say that the solver code is available under the MIT licence at http://code.google.com/p/google-maps-tsp-solver/ . This includes both tsp.js and BpTspSolver.js. If you make changes to the code, which you believe are useful, please consider updating the code repository :-)

Also, I set up a mailing group if you want to track any changes to the code. You can subscribe here: http://groups.google.com/group/google-maps-tsp-solver

Geir</description>
		<content:encoded><![CDATA[<p>Hi Marc,</p>
<p>I have updated the text to say that the solver code is available under the MIT licence at <a href="http://code.google.com/p/google-maps-tsp-solver/" rel="nofollow">http://code.google.com/p/google-maps-tsp-solver/</a> . This includes both tsp.js and BpTspSolver.js. If you make changes to the code, which you believe are useful, please consider updating the code repository <img src='http://gebweb.net/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p>Also, I set up a mailing group if you want to track any changes to the code. You can subscribe here: <a href="http://groups.google.com/group/google-maps-tsp-solver" rel="nofollow">http://groups.google.com/group/google-maps-tsp-solver</a></p>
<p>Geir</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Behind the Scenes of OptiMap by Marc</title>
		<link>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-397</link>
		<author>Marc</author>
		<pubDate>Thu, 06 May 2010 14:48:37 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/07/05/behind-the-scenes-of-optimap/#comment-397</guid>
		<description>Hi! Cool stuff!
I have a question: On your site (http://www.gebweb.net/optimap/) you say that the solver is available under the Common Public licence now (tsp.js) - is that true for the file BpTspSolver.js as well?
Without it, it does not work, right?!

Thanks, Marc</description>
		<content:encoded><![CDATA[<p>Hi! Cool stuff!<br />
I have a question: On your site (http://www.gebweb.net/optimap/) you say that the solver is available under the Common Public licence now (tsp.js) - is that true for the file BpTspSolver.js as well?<br />
Without it, it does not work, right?!</p>
<p>Thanks, Marc</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Optimize Your Trips by Craig</title>
		<link>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-396</link>
		<author>Craig</author>
		<pubDate>Wed, 05 May 2010 07:21:44 +0000</pubDate>
		<guid>http://gebweb.net/blogpost/2007/08/26/optimize-your-trips/#comment-396</guid>
		<description>Hi,

1.) How does one reference you in papers - I don't see your name or development date for this system?
2.) Prior to your system, what other systems could solve the travelling salesman problem (was it confined to high-end GIS software?)</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>1.) How does one reference you in papers - I don&#8217;t see your name or development date for this system?<br />
2.) Prior to your system, what other systems could solve the travelling salesman problem (was it confined to high-end GIS software?)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
