Instances for simple disjunctive temporal problems
Published: 12 January 2023| Version 1 | DOI: 10.17632/jcdmf2wsr3.1
Instances that are part of the paper "Models and algorithms for simple disjunctive temporal problems". This data set contains more than 1,500 instances with various distinct characteristics in order to test the performance of algorithms dedicated to solving SDTPs efficiently. All instance files are formatted using a common JSON structure, which is described in the file README.txt. More information regarding the generation process of these files can be found in the associated paper.
Katholieke Universiteit Leuven
Artificial Intelligence, Operations Research, Constraint Satisfaction, Graph Algorithm, Vehicle Routing Problem, Time Allocation