atlanta-ip: Instance-to-Instance Comparison Results

Type: Instance
Submitter: E-Plus, D. Bienstock, A. Bley, R. Wessäly
Description: Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions
MIPLIB Entry

Parent Instance (atlanta-ip)

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

atlanta-ip Raw atlanta-ip Decomposed atlanta-ip Composite of MIC top 5 atlanta-ip Composite of MIPLIB top 5 atlanta-ip 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.
nw04 decomposed air03 decomposed msc98-ip decomposed eil33-2 decomposed scpl4 decomposed
Name nw04 [MIPLIB] air03 [MIPLIB] msc98-ip [MIPLIB] eil33-2 [MIPLIB] scpl4 [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.446 2 / 1.541 3 / 1.551 4 / 1.569 5 / 1.569
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
nw04 raw air03 raw msc98-ip raw eil33-2 raw scpl4 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.
msc98-ip decomposed rococoC11-011100 decomposed lr1dr02vc05v8a-t360 decomposed sing44 decomposed sing326 decomposed
Name msc98-ip [MIPLIB] rococoC11-011100 [MIPLIB] lr1dr02vc05v8a-t360 [MIPLIB] sing44 [MIPLIB] sing326 [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.551 266 / 2.241 350 / 2.301 577 / 2.409 606 / 2.425
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
msc98-ip raw rococoC11-011100 raw lr1dr02vc05v8a-t360 raw sing44 raw sing326 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance atlanta-ip [MIPLIB] E-Plus, D. Bienstock, A. Bley, R. Wessäly Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions 0.000000 -
MIC Top 5 nw04 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.446090 1
air03 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 1.540777 2
msc98-ip [MIPLIB] E-Plus, D. Bienstock, A. Bley, R. Wessäly Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions 1.550803 3
eil33-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB 1.568604 4
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 1.568861 5
MIPLIB Top 5 msc98-ip [MIPLIB] E-Plus, D. Bienstock, A. Bley, R. Wessäly Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions 1.550803 3
rococoC11-011100 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network. Solved by Gurobi 4.5.1 (4 threads) in 66892.47 seconds. 2.241206 266
lr1dr02vc05v8a-t360 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour. 2.301471 350
sing44 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. 2.408866 577
sing326 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. 2.424625 606


atlanta-ip: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: no model group assignment
Assigned Model Group Rank/ISS in the MIC: N.A. / N.A.

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-101 Model group: generated Model group: independentset Model group: neos-pseudoapplication-21 Model group: f2gap
Name neos-pseudoapplication-101 generated independentset neos-pseudoapplication-21 f2gap
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 / 2.167 2 / 2.182 3 / 2.189 4 / 2.225 5 / 2.276

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 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. 2.167218 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. 2.182044 2
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.189394 3
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.224562 4
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 2.276354 5