-
Single Salesman Returning CETSP dataset
The dataset used in the paper is a set of 10 nodes data for the single salesman returning CETSP problem. -
Single-Depot Returning 2TSP dataset
The dataset used in the paper is a set of 59 nodes data for the non-returning 2TSP, returning 2TSP, and single-depot returning 2TSP problems. -
Non-returning 2TSP, Returning 2TSP, and Single-Depot Returning 2TSP datasets
The dataset used in the paper is a set of 59 nodes data for the non-returning 2TSP, returning 2TSP, and single-depot returning 2TSP problems. -
Traveling Salesman Problem (TSP) instances
The dataset used in the paper is the Traveling Salesman Problem (TSP) instances, specifically the Burma'7 instance, and six additional instances with 5 to 14 nodes. -
Traveling Salesman Problem (TS) dataset
The dataset used in this paper is the Traveling Salesman Problem (TS) dataset, which consists of a set of instances with each instance I assigned a finite set of solutions. -
TSP dataset
The dataset used in this paper is a set of 10 city TSP samples with different parameters. -
Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a classic problem in combinatorial optimization and operations research that involves finding the shortest possible tour that visits each...
