×
lr2-22dr3-333vc4v17a-t60: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Dimitri Papageorgiou |
Description: | Maritime Inventory Routing Problem Library - Group 1 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. As of 2012, Group 1 instances gave Cplex and Gurobi tremendous difficulty finding a single feasible solution. |
MIPLIB Entry |
Parent Instance (lr2-22dr3-333vc4v17a-t60)
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 | assign1-10-4 [MIPLIB] | siena1 [MIPLIB] | v150d30-2hopcds [MIPLIB] | core4872-1529 [MIPLIB] | dc1c [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.318 | 2 / 1.352 | 3 / 1.396 | 4 / 1.404 | 5 / 1.411 | |
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 | neos-3682128-sandon [MIPLIB] | uccase9 [MIPLIB] | uccase8 [MIPLIB] | sing326 [MIPLIB] | sing44 [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.
|
343 / 2.591 | 617 / 2.852 | 624 / 2.857 | 859 / 3.005 | 867 / 3.013 | |
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 lr2-22dr3-333vc4v17a-t60, the five most similar instances to lr2-22dr3-333vc4v17a-t60 according to the MIC, and the five most similar instances to lr2-22dr3-333vc4v17a-t60 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | lr2-22dr3-333vc4v17a-t60 [MIPLIB] | Dimitri Papageorgiou | Maritime Inventory Routing Problem Library - Group 1 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. As of 2012, Group 1 instances gave Cplex and Gurobi tremendous difficulty finding a single feasible solution. | 0.000000 | - |
MIC Top 5 | assign1-10-4 [MIPLIB] | Robert Fourer | Imported from the MIPLIB2010 submissions. | 1.318072 | 1 |
siena1 [MIPLIB] | Double-Click SAS | Crew scheduling instance | 1.352156 | 2 | |
v150d30-2hopcds [MIPLIB] | 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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. | 1.395864 | 3 | |
core4872-1529 [MIPLIB] | A. Caprara, M. Fischetti, P. Toth | Set covering instance coming from Italian railway models | 1.404084 | 4 | |
dc1c [MIPLIB] | Double-Click SAS | Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs. | 1.411482 | 5 | |
MIPLIB Top 5 | neos-3682128-sandon [MIPLIB] | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 2.590518 | 343 |
uccase9 [MIPLIB] | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 2.852284 | 617 | |
uccase8 [MIPLIB] | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 2.857308 | 624 | |
sing326 [MIPLIB] | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 3.004506 | 859 | |
sing44 [MIPLIB] | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 3.012755 | 867 |
lr2-22dr3-333vc4v17a-t60: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | maritime |
Assigned Model Group Rank/ISS in the MIC: | 25 / 2.189 |
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 | assign1 | iis | 2hopcds | misc | maxfeassub | |
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.638 | 2 / 1.710 | 3 / 1.730 | 4 / 1.732 | 5 / 1.748 |
Model Group Summary
The table below contains summary information for the five most similar model groups to lr2-22dr3-333vc4v17a-t60 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | assign1 | Robert Fourer | Imported from the MIPLIB2010 submissions. | 1.637570 | 1 |
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. | 1.709590 | 2 | |
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.729724 | 3 | |
misc | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.731524 | 4 | |
maxfeassub | Marc Pfetsch | Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. | 1.748045 | 5 |