reblock354: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Andreas Bley
Description: Multi-period mine production scheduling instance. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.
MIPLIB Entry

Parent Instance (reblock354)

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

reblock354 Raw reblock354 Decomposed reblock354 Composite of MIC top 5 reblock354 Composite of MIPLIB top 5 reblock354 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.
air04 decomposed air05 decomposed reblock115 decomposed core2586-950 decomposed v150d30-2hopcds decomposed
Name air04 [MIPLIB] air05 [MIPLIB] reblock115 [MIPLIB] core2586-950 [MIPLIB] v150d30-2hopcds [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 / 1.143 2 / 1.211 3 / 1.223 4 / 1.226 5 / 1.227
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
air04 raw air05 raw reblock115 raw core2586-950 raw v150d30-2hopcds 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.
reblock115 decomposed reblock166 decomposed mine-166-5 decomposed mine-90-10 decomposed reblock420 decomposed
Name reblock115 [MIPLIB] reblock166 [MIPLIB] mine-166-5 [MIPLIB] mine-90-10 [MIPLIB] reblock420 [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.
3 / 1.223 33 / 1.486 55 / 1.595 59 / 1.612 67 / 1.718
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
reblock115 raw reblock166 raw mine-166-5 raw mine-90-10 raw reblock420 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance reblock354 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. 0.000000 -
MIC Top 5 air04 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 1.143485 1
air05 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 1.211334 2
reblock115 [MIPLIB] Andreas Bley Multi-period mine production scheduling instances 1.222519 3
core2586-950 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models 1.225678 4
v150d30-2hopcds [MIPLIB] Austin Buchanan A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 1.226571 5
MIPLIB Top 5 reblock115 [MIPLIB] Andreas Bley Multi-period mine production scheduling instances 1.222519 3
reblock166 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 1.486040 33
mine-166-5 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 1.595393 55
mine-90-10 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 1.611684 59
reblock420 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 1.718004 67


reblock354: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: reblock
Assigned Model Group Rank/ISS in the MIC: 21 / 1.833

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: 2hopcds Model group: iis Model group: f2gap Model group: assign1 Model group: neos-pseudoapplication-103
Name 2hopcds iis f2gap assign1 neos-pseudoapplication-103
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.378 2 / 1.457 3 / 1.467 4 / 1.493 5 / 1.514

Model Group Summary

The table below contains summary information for the five most similar model groups to reblock354 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 2hopcds Austin Buchanan A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 1.377921 1
iis Marc Pfetsch 23 "middlehard" Set-Covering Models for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the models can be created. 1.457211 2
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.467395 3
assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 1.493184 4
neos-pseudoapplication-103 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.514239 5


Updated August 16, 2019