timtab1CUTS: Instance-to-Instance Comparison Results

Type: Instance
Submitter: C. Liebchen, R. Möhring
Description: Public transport scheduling problem
MIPLIB Entry

Parent Instance (timtab1CUTS)

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

timtab1CUTS Raw timtab1CUTS Decomposed timtab1CUTS Composite of MIC top 5 timtab1CUTS Composite of MIPLIB top 5 timtab1CUTS 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.
mad decomposed gen-ip054 decomposed f2gap40400 decomposed neos-3322547-alsek decomposed neos-848589 decomposed
Name mad [MIPLIB] gen-ip054 [MIPLIB] f2gap40400 [MIPLIB] neos-3322547-alsek [MIPLIB] neos-848589 [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.862 2 / 0.918 3 / 0.968 4 / 0.979 5 / 0.982
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
mad raw gen-ip054 raw f2gap40400 raw neos-3322547-alsek raw neos-848589 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.
ic97_tension decomposed csched007 decomposed neos-4338804-snowy decomposed neos-3610173-itata decomposed icir97_tension decomposed
Name ic97_tension [MIPLIB] csched007 [MIPLIB] neos-4338804-snowy [MIPLIB] neos-3610173-itata [MIPLIB] icir97_tension [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.
25 / 1.119 162 / 1.327 269 / 1.393 618 / 1.556 810 / 1.805
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
ic97_tension raw csched007 raw neos-4338804-snowy raw neos-3610173-itata raw icir97_tension raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance timtab1CUTS [MIPLIB] C. Liebchen, R. Möhring Public transport scheduling problem 0.000000 -
MIC Top 5 mad [MIPLIB] Koichi Fujii Mean-Absolute Deviation Model for Car Dealerships 0.861921 1
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. 0.918259 2
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.968092 3
neos-3322547-alsek [MIPLIB] Jeff Linderoth (None provided) 0.979050 4
neos-848589 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.981864 5
MIPLIB Top 5 ic97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.118955 25
csched007 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 1.326617 162
neos-4338804-snowy [MIPLIB] Jeff Linderoth (None provided) 1.392801 269
neos-3610173-itata [MIPLIB] Jeff Linderoth (None provided) 1.556316 618
icir97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.805042 810


timtab1CUTS: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: timtab
Assigned Model Group Rank/ISS in the MIC: 1 / 0.758

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: timtab Model group: scp Model group: neos-pseudoapplication-74 Model group: neos-pseudoapplication-21 Model group: markshare
Name timtab scp neos-pseudoapplication-74 neos-pseudoapplication-21 markshare
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.758 2 / 1.319 3 / 1.418 4 / 1.465 5 / 1.477

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 timtab C. Liebchen, R. Möhring Public transport scheduling problem 0.758291 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.319347 2
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.417866 3
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.464918 4
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.477275 5