解决红宝石的旅行商问题（50+地点） [英] Solving the Travelling Salesman Problem in ruby (50+ locations)

问题描述

我工作在一个快递公司。目前，我们解决了50多个位置的路线的手。

I am working in a delivery company. We currently solve 50+ locations routes by "hand".

我一直在思考如何使用谷歌地图API来解决这个问题，但我已阅读，有一个24分的限制。

I have been thinking about using Google Maps API to solve this problem, but I have read that there is a 24 points limit.

目前，我们使用的是在我们的服务器上轨，所以我想用一个Ruby脚本，将得到的50多个地点，并输出一个合理的解决方案的坐标。

Currently we are using rails in our server so I am thinking about using a ruby script that would get the coordinates of the 50+ locations and output a reasonable solution.

你会用什么算法来解决这个问题？

What algorithm would you use to approach this problem?

是Ruby的一个很好的编程语言来解决这类问题？

Is Ruby a good programming language to solve this type of problem?

你知道的任何现有的Ruby脚本？

Do you know of any existing ruby script?

推荐答案

这可能是你在找什么：

警告：

本网站被标记由Firefox作为攻击网站 - 但我似乎没有定。其实我之前使用它没有问题

this site gets flagged by firefox as attack site - but I doesn't appear to be. In fact I used it before without a problem

[查看修订历史URL]

[Check revision history for URL]

ruby​​quiz似乎下降（已经下了一点），但是你仍然可以检查出Wayback机器和archive.org看到页面： http://web.archive.org/web/20100105132957 /http://rubyquiz.com/quiz142.html

rubyquiz seems to be down ( has been down for a bit) however you can still check out WayBack machine and archive.org to see that page: http://web.archive.org/web/20100105132957/http://rubyquiz.com/quiz142.html

这篇关于解决红宝石的旅行商问题（50+地点）的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！