×
![]()
bab3: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | Elmar Swarat |
| Description: | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems |
| MIPLIB Entry |
Parent Instance (bab3)
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 | eil33-2 [MIPLIB] | f2gap801600 [MIPLIB] | scpl4 [MIPLIB] | f2gap401600 [MIPLIB] | iis-glass-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 / 1.375 | 2 / 1.406 | 3 / 1.424 | 4 / 1.431 | 5 / 1.432 | |
|
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 | bab5 [MIPLIB] | neos-3555904-turama [MIPLIB] | n2seq36q [MIPLIB] | bab2 [MIPLIB] | bab6 [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.
|
39 / 1.648 | 171 / 1.988 | 195 / 2.009 | 217 / 2.030 | 613 / 2.288 | |
|
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 bab3, the five most similar instances to bab3 according to the MIC, and the five most similar instances to bab3 according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | bab3 [MIPLIB] | Elmar Swarat | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems | 0.000000 | - |
| MIC Top 5 | eil33-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB | 1.375293 | 1 |
| f2gap801600 [MIPLIB] | Salim Haddadi | Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.405983 | 2 | |
| 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.423639 | 3 | |
| f2gap401600 [MIPLIB] | Salim Haddadi | Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.431447 | 4 | |
| iis-glass-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. | 1.431808 | 5 | |
| MIPLIB Top 5 | bab5 [MIPLIB] | Elmar Swarat | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems | 1.648143 | 39 |
| neos-3555904-turama [MIPLIB] | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.988163 | 171 | |
| n2seq36q [MIPLIB] | R. Meirich | Static line planning models on the Dutch IC network | 2.008821 | 195 | |
| bab2 [MIPLIB] | Elmar Swarat | Vehicle Routing with profits and an integrated crew scheduling formulated by two coupled multi-commodity flow problems. | 2.029887 | 217 | |
| bab6 [MIPLIB] | Elmar Swarat | Vehicle routing with profit and an integrated crew scheduling like bab2 - bab5. Instances differ in multi-commodity-flow formulation (path oder arc formulation) or time discretization and some are quite easy to solve while others (bab2, bab3 and bab6) are very difficult. | 2.288045 | 613 |
bab3: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | bab |
| Assigned Model Group Rank/ISS in the MIC: | 69 / 2.465 |
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 | neos-pseudoapplication-101 | generated | neos-pseudoapplication-21 | independentset | 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 / 1.594 | 2 / 1.607 | 3 / 1.665 | 4 / 1.711 | 5 / 1.783 |
Model Group Summary
The table below contains summary information for the five most similar model groups to bab3 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. | 1.594091 | 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. | 1.606957 | 2 | |
| neos-pseudoapplication-21 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.664717 | 3 | |
| independentset | Toni Sorrell | These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. | 1.710808 | 4 | |
| f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.783304 | 5 |
