lr1dr04vc05v17a-t360: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Dimitri Papageorgiou
Description: 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.
MIPLIB Entry

Parent Instance (lr1dr04vc05v17a-t360)

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

lr1dr04vc05v17a-t360 Raw lr1dr04vc05v17a-t360 Decomposed lr1dr04vc05v17a-t360 Composite of MIC top 5 lr1dr04vc05v17a-t360 Composite of MIPLIB top 5 lr1dr04vc05v17a-t360 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.
chromaticindex1024-7 decomposed chromaticindex512-7 decomposed chromaticindex256-8 decomposed chromaticindex128-5 decomposed sp97ar decomposed
Name chromaticindex1024-7 [MIPLIB] chromaticindex512-7 [MIPLIB] chromaticindex256-8 [MIPLIB] chromaticindex128-5 [MIPLIB] sp97ar [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.322 2 / 1.338 3 / 1.411 4 / 1.509 5 / 1.556
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
chromaticindex1024-7 raw chromaticindex512-7 raw chromaticindex256-8 raw chromaticindex128-5 raw sp97ar 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.
csched007 decomposed neos-1067731 decomposed csched010 decomposed lr1dr02vc05v8a-t360 decomposed lr1dr12vc10v70b-t360 decomposed
Name csched007 [MIPLIB] neos-1067731 [MIPLIB] csched010 [MIPLIB] lr1dr02vc05v8a-t360 [MIPLIB] lr1dr12vc10v70b-t360 [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.
120 / 2.069 144 / 2.104 159 / 2.127 374 / 2.377 986 / 3.138
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
csched007 raw neos-1067731 raw csched010 raw lr1dr02vc05v8a-t360 raw lr1dr12vc10v70b-t360 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance lr1dr04vc05v17a-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. 0.000000 -
MIC Top 5 chromaticindex1024-7 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. 1.322446 1
chromaticindex512-7 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. 1.337622 2
chromaticindex256-8 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. 1.410810 3
chromaticindex128-5 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. 1.509409 4
sp97ar [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance. Solved with Gurobi 4.5.1 on a 12-core Linux system in 2678.77 sec. 1.556247 5
MIPLIB Top 5 csched007 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 2.068643 120
neos-1067731 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.104092 144
csched010 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 2.127109 159
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.376948 374
lr1dr12vc10v70b-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. 3.138169 986


lr1dr04vc05v17a-t360: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: maritime
Assigned Model Group Rank/ISS in the MIC: 209 / 3.680

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: pigeon Model group: satellites Model group: c1s1 Model group: neos-pseudoapplication-15 Model group: neos-pseudoapplication-32
Name pigeon satellites c1s1 neos-pseudoapplication-15 neos-pseudoapplication-32
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.899 2 / 2.094 3 / 2.141 4 / 2.180 5 / 2.181

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 pigeon Sam Allen Model of 3D packing (container loading) problem 1.899434 1
satellites He Renjie Ihe attachment is some models generated from real life satelliteschedule problem data,these models are easier comparable to real lifeproblem. The work is done by me and Alberto Ceselli from Univeristy ofMilano. I donnot know it is hard enough or not, if needs , I can generatemore difficult models. 2.094235 2
c1s1 M. Vyve, Y. Pochet Lot sizing model. 2.140892 3
neos-pseudoapplication-15 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.180150 4
neos-pseudoapplication-32 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.181279 5