什么是切实解决旅行商prblem,使用谷歌地图? [英] What is a practical solution to the Travelling Salesman prblem, using Google Maps?
问题描述
什么是切实解决旅行商问题,用谷歌地图/地理位置/路由发现?
What is a practical solution to the Travelling Salesman problem, using Google Maps / geolocation / route finding?
我并不需要的最佳解决方案,在5%以内就可以了。
I don't need the best solution, within 5% would be fine.
例如,我在英国的20个地方参观,以任何顺序。这可能需要扩展到数百个位置。
For example, I have 20 locations in the UK to visit, in any order. This may need to scale to hundreds of locations.
我可以使用什么样的算法,因为我可以查找距离(但不希望查找数以百计的距离)?
What sort of algorithm can I use, given that I can lookup distances (but don't want to lookup hundreds of distances)?
推荐答案
我你正在寻找一个多项式近似的欧几里德TSP,一些算法已经被提出。看看这里。
I you are looking for a polynomial approximation for the Euclidean TSP, several algorithms have been suggested. Have a look here.
这篇关于什么是切实解决旅行商prblem,使用谷歌地图?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!