Back to datasets
Dataset assetOpen Source CommunityTraveling Salesman ProblemAlgorithm Evaluation
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.
Source
github
Created
Nov 14, 2024
Updated
Nov 14, 2024
Signals
1,023 views
Availability
Linked source ready
Overview
Dataset description and usage context
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.
Need downstream help?
Pair the dataset with AI analysis and content workflows.
Once the source passes your review, move straight into summarization, transformation, report drafting, or presentation generation with the JuheAI toolchain.