Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 4166 7023 4.52802e-04 easy vrp 34 cvrpsimple2i.mps.gz

These are the instances from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these instances can only be handled by solvers accepting indicator constraints. For instances compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the instances with full paths to mzn/dzn files of each instance per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt –slvPrf MZN-CPLEX –debug 1 –addOption “–timeout 3 -D fIndConstr=true -D fMIPdomains=false” –useJoinedName “–writeModel MODELS_IND/%s.mps” Alternatively, you can compile individual instance as follows: $> mzn-cplex -v -s -G linear –output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a –timeout 3 -D fIndConstr=true -D fMIPdomains=false –writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 4166 2994
Constraints 7023 5806
Binaries 648 459
Integers 243 242
Continuous 3275 2293
Implicit Integers 52 80
Fixed Variables 49 0
Nonzero Density 0.000452802 0.000464587
Nonzeroes 13248 8076
Constraint Classification Properties
Original Presolved
Total 4165 3762
Empty 0 0
Free 0 0
Singleton 91 450
Aggregations 477 386
Precedence 73 835
Variable Bound 104 918
Set Partitioning 28 28
Set Packing 28 28
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 14 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 2820 742
General Linear 530 375
Indicator 2858 2858

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 34 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to cvrpsimple2i in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Status Objective
cvrpp-n16k8vrpi 18294 2832 531 14931 31615 60544 Gleb Belov vrp open 450*
cvrpb-n45k5vrpi 153202 23625 1575 128002 268835 519556 Gleb Belov pb- open 2009*
cvrpa-n64k9vrpi 312726 48192 2259 262275 550111 1064700 Gleb Belov vrp open 3143*
stoch-vrpvrp-s5v2c8vrp-v2c8i 8436 1485 734 6217 13813 26231 Gleb Belov vrp open 330*
amaze22012-06-28i 12691 4376 914 7401 17319 33831 Gleb Belov amaze easy 0

Reference

@article{MZChPhil2010,
year={2010},
journal={Constraints},
volume={15},
number={3},
title={Philosophy of the {MiniZinc} challenge},
publisher={Springer US},
author={Stuckey, P. J. and Becket, R. and Fischer, J.},
pages={307--316},
}
@incollection{BelovEtAl_Lin16,
author="Belov, G.
and Stuckey, P. J.
and Tack, G.
and Wallace, M.",
editor="Rueher, M.",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
}

Last Update Nov 19, 2018 by Gregor Hendel
generated with R Markdown
© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint