s250r10: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Daniel Espinoza
Description: Wine Scheduling problem with 250 jobs (up to 10 alternatives for processing) and four processing machines
MIPLIB Entry

Parent Instance (s250r10)

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

s250r10 Raw s250r10 Decomposed s250r10 Composite of MIC top 5 s250r10 Composite of MIPLIB top 5 s250r10 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.
neos-1603965 decomposed nsa decomposed ic97_tension decomposed neos-5221106-oparau decomposed neos-4954274-beardy decomposed
Name neos-1603965 [MIPLIB] nsa [MIPLIB] ic97_tension [MIPLIB] neos-5221106-oparau [MIPLIB] neos-4954274-beardy [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.433 2 / 1.439 3 / 1.449 4 / 1.451 5 / 1.452
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
neos-1603965 raw nsa raw ic97_tension raw neos-5221106-oparau raw neos-4954274-beardy 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.
neos-780889 decomposed s55 decomposed bab6 decomposed rococoC11-010100 decomposed s82 decomposed
Name neos-780889 [MIPLIB] s55 [MIPLIB] bab6 [MIPLIB] rococoC11-010100 [MIPLIB] s82 [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.
66 / 1.578 515 / 1.802 613 / 1.871 715 / 1.957 847 / 2.148
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
neos-780889 raw s55 raw bab6 raw rococoC11-010100 raw s82 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance s250r10 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 250 jobs (up to 10 alternatives for processing) and four processing machines 0.000000 -
MIC Top 5 neos-1603965 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.432847 1
nsa [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.438775 2
ic97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.448905 3
neos-5221106-oparau [MIPLIB] Hans Mittelmann Seem to be VRP output from 2-hour runs of Gurobi on 12 threads is included 1.451311 4
neos-4954274-beardy [MIPLIB] Jeff Linderoth Reported solved after 77000 seconds using Gurobi with 32 threads. 1.451938 5
MIPLIB Top 5 neos-780889 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.578275 66
s55 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 55 jobs and four processing machines 1.801595 515
bab6 [MIPLIB] Elmar Swarat Vehicle routing with profit and an integrated crew scheduling like bab2 - bab5. Instances differ in multi-commodity-flow formulation (path oder arc formulation) or time discretization and some are quite easy to solve while others (bab2, bab3 and bab6) are very difficult. 1.870717 613
rococoC11-010100 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network. 1.956886 715
s82 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 82 jobs and four processing machines 2.148069 847


s250r10: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: Spinoza
Assigned Model Group Rank/ISS in the MIC: 129 / 2.567

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-96 Model group: scp Model group: allcolor Model group: neos-pseudoapplication-109 Model group: lectsched
Name neos-pseudoapplication-96 scp allcolor neos-pseudoapplication-109 lectsched
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.860 2 / 1.865 3 / 1.875 4 / 1.876 5 / 1.904

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 neos-pseudoapplication-96 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.859978 1
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.864839 2
allcolor Domenico Salvagnin Prepack optimization model. 1.875148 3
neos-pseudoapplication-109 Jeff Linderoth (None provided) 1.876434 4
lectsched Harald Schilly University lecture scheduling model 1.904086 5