旅行商例如已知全局最优 [英] Traveling salesman example with known global optimum

问题描述

我在Python做了一个模因算法旅行商问题。 然而，所有的测试数据（城市之间的距离的列表）我遇到缺少的最佳解决方案的信息，所以我不知道如何接近全局最优解我的算法得到。

I made a memetic algorithm in Python for traveling salesman problem. However, all the test data (list of distances between cities) I've encountered lack the information of the best solution, so I can't know how close to global optimum my algorithm gets.

有谁知道在哪里可以找到一些茶匙的测试数据（以矩阵形式preferably，但任何事情都有好的）与已知的最佳解决方案？

Does anyone know where I can find some tsp test data (preferably in matrix form, but anything's good) with known best solution?

推荐答案

你谷歌？

http://www.tsp.gatech.edu/data/index.html

该网页提供了多种测试例，其中16有一个最佳的解决方案。

That page provides several test-cases of which 16 has an optimal solution.

这篇关于旅行商例如已知全局最优的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！