Traveling Salesman Problem with Job-times (TSPJ) Benchmark Instances based on TSPLIB

Description

This dataset contains benchmark instances for the Traveling Salesman Problem with Job-times (TSPJ), extended from 10 classic symmetric and asymmetric TSPLIB instances. To model the job-time requirement, an additional processing time matrix has been incorporated into each instance. The processing times are derived from 50% to 80% of the Best Known Solution (BKS) value of each corresponding TSPLIB problem. This dataset is suitable for evaluating optimization algorithms, metaheuristics, and mathematical models addressing combined routing and scheduling problems.

Categories

Licence