f2gap801600: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Salim Haddadi
Description: Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)
MIPLIB Entry

Parent Instance (f2gap801600)

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

f2gap801600 Raw f2gap801600 Decomposed f2gap801600 Composite of MIC top 5 f2gap801600 Composite of MIPLIB top 5 f2gap801600 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.
neos5 decomposed mod010 decomposed scpl4 decomposed f2gap401600 decomposed neos-5189128-totara decomposed
Name neos5 [MIPLIB] mod010 [MIPLIB] scpl4 [MIPLIB] f2gap401600 [MIPLIB] neos-5189128-totara [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.583 2 / 0.669 3 / 0.670 4 / 0.687 5 / 0.691
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
neos5 raw mod010 raw scpl4 raw f2gap401600 raw neos-5189128-totara 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.
f2gap401600 decomposed f2gap201600 decomposed f2gap40400 decomposed ic97_potential decomposed icir97_potential decomposed
Name f2gap401600 [MIPLIB] f2gap201600 [MIPLIB] f2gap40400 [MIPLIB] ic97_potential [MIPLIB] icir97_potential [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.
4 / 0.687 24 / 1.001 47 / 1.213 365 / 1.747 554 / 1.843
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
f2gap401600 raw f2gap201600 raw f2gap40400 raw ic97_potential raw icir97_potential raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.000000 -
MIC Top 5 neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.582941 1
mod010 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.669231 2
scpl4 [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 0.669721 3
f2gap401600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.686611 4
neos-5189128-totara [MIPLIB] Hans Mittelmann distribution of fruit 0.691122 5
MIPLIB Top 5 f2gap401600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.686611 4
f2gap201600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.001080 24
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.212563 47
ic97_potential [MIPLIB] L. Peeters A model for cyclic railway timetable optimization 1.746787 365
icir97_potential [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.843153 554


f2gap801600: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: f2gap
Assigned Model Group Rank/ISS in the MIC: 6 / 1.102

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: neos-pseudoapplication-21 Model group: generated Model group: independentset Model group: neos-pseudoapplication-101 Model group: scp
Name neos-pseudoapplication-21 generated independentset neos-pseudoapplication-101 scp
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.652 2 / 0.687 3 / 0.811 4 / 0.874 5 / 0.939

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.651516 1
generated Simon Bowly Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 0.686629 2
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 0.811025 3
neos-pseudoapplication-101 NEOS Server Submission Model coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively. 0.874292 4
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 0.939084 5


Updated August 16, 2019