DATASET
Open Source Community
TSPLIB
The TSPLIB dataset is a standard benchmark for the Traveling Salesman Problem (TSP), containing coordinate information for multiple cities used to evaluate the performance of various algorithms.
Updated 11/14/2024
github
Description
TSPLIB Dataset Benchmark
Dataset Overview
- Dataset name: pla85900.tsp
- Number of nodes: 85900
- Source: TSPLIB
Test Results
- Algorithm: h2CurveSort
- Distance: 188465250 (CEIL_2D)
- Optimal distance: 142382641 (CEIL_2D)
- Distance ratio: 1.32
Visualization
- Optimal path:
- Hilbert Curve path:
Defects
- Issue: The TSP requires a closed tour, whereas Hilbert Curve Sort provides only a simple path.
- Impact: Increases the distance between the start and end nodes, resulting in a larger total distance.
AI studio
Generate PPTs instantly with Nano Banana Pro.
Generate PPT NowAccess Dataset
Login to Access
Please login to view download links and access full dataset details.
Topics
Traveling Salesman Problem
Algorithm Evaluation
Source
Organization: github
Created: 11/14/2024
Power Your Data Analysis with Premium AI Models
Supporting GPT-5, Claude-4, DeepSeek v3, Gemini and more.
Enjoy a free trial and save 20%+ compared to official pricing.