Name | TravellingSalesman/TravellingSalesman-m1-n15/ TravellingSalesman-15-30-06.xml |
MD5SUM | ade148a10c7d29c0192a6b2badaa2a73 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 99 |
Best CPU time to get the best result obtained on this benchmark | 53.9509 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 30 |
Number of constraints | 16 |
Number of domains | 2 |
Minimum domain size | 15 |
Maximum domain size | 31 |
Distribution of domain sizes | [{"size":15,"count":15},{"size":31,"count":15}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":15}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 15 |
Distribution of constraint arities | [{"arity":3,"count":15},{"arity":15,"count":1}] |
Number of extensional constraints | 15 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":15},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407801 | OPT | 99 | 53.9509 | 53.9581 |
cosoco 2.0 (complete) | 4397537 | OPT | 99 | 428.297 | 428.309 |
cosoco 2 (complete) | 4394793 | OPT | 99 | 432.255 | 432.276 |
cosoco 2.0 (complete) | 4408797 | OPT | 99 | 433.272 | 433.283 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 99<instantiation> <list> d[] c[] </list> <values> 2 8 6 9 3 9 5 5 5 11 7 5 5 6 13 14 13 10 7 4 5 2 3 0 1 6 8 9 11 12 </values> </instantiation>