2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
BusScheduling/BusScheduling-cnt-s1/
BusScheduling-cnt-r5.xml

Jump to solvers results

General information on the benchmark

NameBusScheduling/BusScheduling-cnt-s1/
BusScheduling-cnt-r5.xml
MD5SUM13c07461cd5d6cd59c34e2b3a9f24c58
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmark
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables2202
Number of constraints241
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":2202}]
Minimum variable degree5
Maximum variable degree15
Distribution of variable degrees[{"degree":5,"count":19},{"degree":6,"count":72},{"degree":7,"count":142},{"degree":8,"count":315},{"degree":9,"count":566},{"degree":10,"count":547},{"degree":11,"count":320},{"degree":12,"count":138},{"degree":13,"count":49},{"degree":14,"count":27},{"degree":15,"count":7}]
Minimum constraint arity38
Maximum constraint arity188
Distribution of constraint arities[{"arity":38,"count":5},{"arity":43,"count":2},{"arity":44,"count":2},{"arity":49,"count":2},{"arity":50,"count":9},{"arity":51,"count":3},{"arity":52,"count":3},{"arity":53,"count":7},{"arity":54,"count":4},{"arity":55,"count":9},{"arity":56,"count":1},{"arity":57,"count":5},{"arity":58,"count":1},{"arity":59,"count":2},{"arity":60,"count":2},{"arity":61,"count":2},{"arity":62,"count":7},{"arity":63,"count":5},{"arity":64,"count":9},{"arity":65,"count":2},{"arity":66,"count":3},{"arity":67,"count":2},{"arity":68,"count":6},{"arity":69,"count":2},{"arity":70,"count":9},"...",{"arity":108,"count":2}, {"arity":109,"count":2}, {"arity":110,"count":1}, {"arity":114,"count":1}, {"arity":115,"count":2}, {"arity":116,"count":1}, {"arity":119,"count":1}, {"arity":122,"count":2}, {"arity":123,"count":1}, {"arity":125,"count":1}, {"arity":126,"count":1}, {"arity":127,"count":1}, {"arity":128,"count":1}, {"arity":129,"count":1}, {"arity":130,"count":1}, {"arity":135,"count":1}, {"arity":136,"count":1}, {"arity":137,"count":1}, {"arity":139,"count":1}, {"arity":140,"count":1}, {"arity":141,"count":1}, {"arity":145,"count":1}, {"arity":149,"count":1}, {"arity":171,"count":1}, {"arity":188,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"count","count":241}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257435? (TO) 242.3 240.011
OscaR - Conflict Ordering 2017-07-26 (complete)4255944? (TO) 242.52901 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256441? (TO) 242.655 240.01199
OscaR - ALNS 2017-07-26 (complete)4255447? (TO) 242.67999 240.01801
choco-solver 4.0.5 seq (2017-08-18) (complete)4282772? (TO) 243.83701 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4253956? (TO) 243.86 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270022? (TO) 243.918 240.022
sat4j-CSP 2017-07-05 (complete)4257932? (TO) 245.119 240.254
choco-solver 5a (2017-08-18) (complete)4284242? (TO) 250.664 240.03101
choco-solver 5a (2017-07-26) (complete)4254950? (TO) 250.72 240.00999
Concrete 3.4 (complete)4259423? (TO) 251.20399 240.311
cosoco 1.1 (complete)4258429? (TO) 251.869 252.00999
Mistral-2.0 2017-07-28 (complete)4258926? (TO) 251.888 252.011
cosoco 1.12 (complete)4268552? (TO) 251.922 252.00999
cosoco-sat 1.12 (complete)4266621? (TO) 251.93401 252.00999
choco-solver 4.0.5 par (2017-07-26) (complete)4254453? (TO) 1920.65 241.33501
OscaR - Parallel with EPS 2017-07-26 (complete)4256938? (TO) 1921.48 246.80499
OscaR - Parallel with EPS 2017-08-22 (complete)4285712? (TO) 1965.6801 252.11301
choco-solver 4.0.5 par (2017-08-18) (complete)4281302? (TO) 2005.63 252.078
choco-solver 4.0.5 par (2017-08-09) (complete)4271492? (TO) 2006.66 252.11

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found: