rocI-4-11: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Joerg Rambau
Description: Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions
MIPLIB Entry

Parent Instance (rocI-4-11)

All other instances below were be compared against this "query" instance.

rocI-4-11 Raw rocI-4-11 Decomposed rocI-4-11 Composite of MIC top 5 rocI-4-11 Composite of MIPLIB top 5 rocI-4-11 Model Group Composite
Raw This is the CCM image before the decomposition procedure has been applied.
Decomposed This is the CCM image after a decomposition procedure has been applied. This is the image used by the MIC's image-based comparisons for this query instance.
Composite of MIC Top 5 Composite of the five decomposed CCM images from the MIC Top 5.
Composite of MIPLIB Top 5 Composite of the five decomposed CCM images from the MIPLIB Top 5.
Model Group Composite Image Composite of the decomposed CCM images for every instance in the same model group as this query.

MIC Top 5 Instances

These are the 5 decomposed CCM images that are most similar to decomposed CCM image for the the query instance, according to the ISS metric.

Decomposed These decomposed images were created by GCG.
rocI-3-11 decomposed f2gap40400 decomposed gen-ip054 decomposed gen-ip002 decomposed scpm1 decomposed
Name rocI-3-11 [MIPLIB] f2gap40400 [MIPLIB] gen-ip054 [MIPLIB] gen-ip002 [MIPLIB] scpm1 [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
1 / 0.351 2 / 1.316 3 / 1.332 4 / 1.349 5 / 1.371
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
rocI-3-11 raw f2gap40400 raw gen-ip054 raw gen-ip002 raw scpm1 raw

MIPLIB Top 5 Instances

These are the 5 instances that are most closely related to the query instance, according to the instance statistic-based similarity measure employed by MIPLIB 2017

Decomposed These decomposed images were created by GCG.
rocI-3-11 decomposed shipschedule3shipsi decomposed piperout-08 decomposed shipschedule6shipsmixi decomposed shipschedule8shipsmixuci decomposed
Name rocI-3-11 [MIPLIB] shipschedule3shipsi [MIPLIB] piperout-08 [MIPLIB] shipschedule6shipsmixi [MIPLIB] shipschedule8shipsmixuci [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all model groups. A smaller ISS value indicates greater similarity.
1 / 0.351 623 / 1.837 678 / 1.878 742 / 1.926 762 / 1.942
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
rocI-3-11 raw shipschedule3shipsi raw piperout-08 raw shipschedule6shipsmixi raw shipschedule8shipsmixuci raw

Instance Summary

The table below contains summary information for rocI-4-11, the five most similar instances to rocI-4-11 according to the MIC, and the five most similar instances to rocI-4-11 according to MIPLIB 2017.

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance rocI-4-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions 0.000000 -
MIC Top 5 rocI-3-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions 0.350956 1
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.316088 2
gen-ip054 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 1.331635 3
gen-ip002 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 1.348600 4
scpm1 [MIPLIB] Shunji Umetani This is a random test instance generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five instances. We have also generated reduced instances by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 1.370893 5
MIPLIB Top 5 rocI-3-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions 0.350956 1
shipschedule3shipsi [MIPLIB] Gleb Belov 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 1.836829 623
piperout-08 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing 1.878386 678
shipschedule6shipsmixi [MIPLIB] Gleb Belov 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 1.926499 742
shipschedule8shipsmixuci [MIPLIB] Gleb Belov 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 1.942367 762


rocI-4-11: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: rocI
Assigned Model Group Rank/ISS in the MIC: 83 / 2.407

MIC Top 5 Model Groups

These are the 5 model group composite (MGC) images that are most similar to the decomposed CCM image for the query instance, according to the ISS metric.

These are model group composite (MGC) images for the MIC top 5 model groups.
Model group: scp Model group: mc Model group: neos-pseudoapplication-74 Model group: neos-pseudoapplication-21 Model group: stein
Name scp mc neos-pseudoapplication-74 neos-pseudoapplication-21 stein
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
1 / 1.696 2 / 1.754 3 / 1.798 4 / 1.819 5 / 1.858

Model Group Summary

The table below contains summary information for the five most similar model groups to rocI-4-11 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 scp Shunji Umetani This is a random test model generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five models. We have also generated reduced models by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 1.695963 1
mc F. Ortega, L. Wolsey Fixed cost network flow problems 1.753940 2
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.798497 3
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.818921 4
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.857946 5