This directory contains resources accompanying the paper
-
'Explaining Circuit Propagation'.
Authors: Kathryn Francis, Peter Stuckey
[PDF]
Below is a MiniZinc model for each of the four variations of the tour design problem refered to in the paper, and a file containing the predicate definitions.
In all variations of the problem the objective is to minimise the length of the longest leg in the tour.
-
Tour must visit all locations (exactly once) and then return to the start location: circuit.mzn
-
Tour must visit all locations, with no requirement to return to the start location: path.mzn
-
Tour must visit at least one location providing each of a given set of activities, and then return to the start location: subcircuit.mzn
-
Tour must visit at least one location providing each of a given set of activities (no requirement to return to the start location): subpath.mzn:
-
Predicate definitions: circuitpreds.mzn
The instances are provided as MiniZinc data files in two gzipped tar files.
The tar files include a directory for each problem size (number of locations). There are 500 instances of each size.