×
eilA101-2: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | J. Linderoth |
Description: | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB |
MIPLIB Entry |
Parent Instance (eilA101-2)
All other instances below were be compared against this "query" instance.![]() ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | neos-3352863-ancoa [MIPLIB] | eilC76-2 [MIPLIB] | 2club200v15p5scn [MIPLIB] | assign1-10-4 [MIPLIB] | iis-hc-cov [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.476 | 2 / 0.737 | 3 / 0.792 | 4 / 0.860 | 5 / 0.863 | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
|
![]() |
![]() |
![]() |
![]() |
![]() |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | eilC76-2 [MIPLIB] | nw04 [MIPLIB] | ivu06 [MIPLIB] | ds-big [MIPLIB] | eilC76-2** [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.
|
2 / 0.737 | 96 / 1.556 | 857 / 2.334 | 894 / 2.347 | N.A.** / N.A.** | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Instance Summary
The table below contains summary information for eilA101-2, the five most similar instances to eilA101-2 according to the MIC, and the five most similar instances to eilA101-2 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | eilA101-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB | 0.000000 | - |
MIC Top 5 | neos-3352863-ancoa [MIPLIB] | Jeff Linderoth | (None provided) | 0.475632 | 1 |
eilC76-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions. | 0.737120 | 2 | |
2club200v15p5scn [MIPLIB] | Balabhaskar Balasundaram | Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours. | 0.791884 | 3 | |
assign1-10-4 [MIPLIB] | Robert Fourer | Imported from the MIPLIB2010 submissions. | 0.859703 | 4 | |
iis-hc-cov [MIPLIB] | Marc Pfetsch | 23 "middlehard" Set-Covering Instances 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 instances can be created. | 0.862833 | 5 | |
MIPLIB Top 5 | eilC76-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions. | 0.737120 | 2 |
nw04 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.556347 | 96 | |
ivu06 [MIPLIB] | S. Weider | Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days. | 2.333536 | 857 | |
ds-big [MIPLIB] | Steffen Weider | Bus driver duty scheduling problem | 2.347216 | 894 | |
eilC76-2** [MIPLIB] | S. Weider | Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation | N.A.** | N.A.** |
eilA101-2: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | eil |
Assigned Model Group Rank/ISS in the MIC: | 13 / 1.493 |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | iis | 2hopcds | assign1 | neos-pseudoapplication-106 | neos-pseudoapplication-78 | |
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.979 | 2 / 1.025 | 3 / 1.168 | 4 / 1.220 | 5 / 1.259 |
Model Group Summary
The table below contains summary information for the five most similar model groups to eilA101-2 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | 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. | 0.979208 | 1 |
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.024715 | 2 | |
assign1 | Robert Fourer | Imported from the MIPLIB2010 submissions. | 1.168344 | 3 | |
neos-pseudoapplication-106 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.220363 | 4 | |
neos-pseudoapplication-78 | Jeff Linderoth | (None provided) | 1.259334 | 5 |