" T-CTSP-Bench: Benchmark Instances for the Time-Critical Colored Traveling Salesman Problem"

IEEE DataPort 2026 Dataset Open access

Read full text
Authors: Yaxing Duan, Jun Li
DOI: 10.21227/wmfe-q896
Cited by: 0

Abstract

"This dataset contains the city coordinates and color matrices of the instances used for the experiments in the paper \"Safety-Aware Multi-Robot Scheduling under Time-Critical Constraints: A Colored Traveling Salesman Problem Approach\"."

Fields of Study & Subjects

Vehicle Routing Optimization Methods Robotic Path Planning Algorithms Scheduling and Optimization Algorithms

Publication details

Journal / source
IEEE DataPort
Publication date
14 February 2026
Language
EN
Document type
Dataset