wachplan: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Sebastian Orlowski
Description: Shift planning model to assign crew members to shifts for a sail training trip
MIPLIB Entry

Parent Instance (wachplan)

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

wachplan Raw wachplan Decomposed wachplan Composite of MIC top 5 wachplan Composite of MIPLIB top 5 wachplan 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.
ns1952667 decomposed neos-3373491-avoca decomposed neos5 decomposed bnatt500 decomposed bnatt400 decomposed
Name ns1952667 [MIPLIB] neos-3373491-avoca [MIPLIB] neos5 [MIPLIB] bnatt500 [MIPLIB] bnatt400 [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.665 2 / 1.687 3 / 1.702 4 / 1.702 5 / 1.703
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
ns1952667 raw neos-3373491-avoca raw neos5 raw bnatt500 raw bnatt400 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.
mzzv11 decomposed mzzv42z decomposed mitre decomposed neos-1223462 decomposed nursesched-sprint02 decomposed
Name mzzv11 [MIPLIB] mzzv42z [MIPLIB] mitre [MIPLIB] neos-1223462 [MIPLIB] nursesched-sprint02 [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.
403 / 2.167 496 / 2.212 521 / 2.223 668 / 2.284 684 / 2.291
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
mzzv11 raw mzzv42z raw mitre raw neos-1223462 raw nursesched-sprint02 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance wachplan [MIPLIB] Sebastian Orlowski Shift planning model to assign crew members to shifts for a sail training trip 0.000000 -
MIC Top 5 ns1952667 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 1.664586 1
neos-3373491-avoca [MIPLIB] Jeff Linderoth (None provided) 1.686512 2
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.702083 3
bnatt500 [MIPLIB] Tatsuya Akutsu We are submitting ILP data for identification of a singletonattractor in a Boolean newtork, which is a well-known problemin computational systems biology.This problem is known to be NP-hard and we developed a methodto transform an instance of the problem to an integer linearprogram (ILP).We used ILPs from artificially generated Boolean networks ofindegree 3.The size of the networks are: 350, 400, 500.Even for the case of 500, we could not find a solution within6 hours using CPLEX 11.2 on a PC with XEON 5470 3.33GHz CPU.(This ILP corresponds to the case of size=350.File format is (zipped) CPLEX LP format.)The details of the method appeared in:T. Akutsu, M. Hayashida and T. Tamura, Integer programming-basedmethods for attractor detection and control of Boolean networks,Proc. The combined 48th IEEE Conference on Decision and Controland 28th Chinese Control Conference (IEEE CDC/CCC 2009), 5610-5617, 2009. 1.702403 4
bnatt400 [MIPLIB] Tatsuya Akutsu Model to identify a singleton attractor in a Boolean network, applications in computational systems biology. Solved by SCIP 3.0 with SoPlex 1.7.0 in half an hour. A Intel Core2 Extreme CPU X9659 @3.00GHz was used. 1.702610 5
MIPLIB Top 5 mzzv11 [MIPLIB] S. Lukac Railway slot allocation problems 2.166876 403
mzzv42z [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.212042 496
mitre [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.222723 521
neos-1223462 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.283767 668
nursesched-sprint02 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 2.290912 684


wachplan: 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: bnatt Model group: oocsp-racks Model group: neos-pseudoapplication-21 Model group: scp Model group: independentset
Name bnatt oocsp-racks neos-pseudoapplication-21 scp independentset
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.144 2 / 2.218 3 / 2.226 4 / 2.276 5 / 2.303

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 bnatt Tatsuya Akutsu We are submitting ILP data for identification of a singletonattractor in a Boolean newtork, which is a well-known problemin computational systems biology.This problem is known to be NP-hard and we developed a methodto transform an model of the problem to an integer linearprogram (ILP).We used ILPs from artificially generated Boolean networks ofindegree 3.The size of the networks are: 350, 400, 500.Even for the case of 500, we could not find a solution within6 hours using CPLEX 11.2 on a PC with XEON 5470 3.33GHz CPU.(This ILP corresponds to the case of size=350.File format is (zipped) CPLEX LP format.)The details of the method appeared in:T. Akutsu, M. Hayashida and T. Tamura, Integer programming-basedmethods for attractor detection and control of Boolean networks,Proc. The combined 48th IEEE Conference on Decision and Controland 28th Chinese Control Conference (IEEE CDC/CCC 2009), 5610-5617, 2009. 2.144065 1
oocsp-racks Gleb Belov These are the models from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these models can only be handled by solvers accepting indicator constraints. For models compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the models with full paths to mzn/dzn files of each model per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt -slvPrf MZN-CPLEX -debug 1 -addOption "-timeout 3 -D fIndConstr=true -D fMIPdomains=false" -useJoinedName "-writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual model as follows: $> mzn-cplex -v -s -G linear -output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a -timeout 3 -D fIndConstr=true -D fMIPdomains=false -writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps 2.218320 2
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.225743 3
scp Shunji Umetani This is a random test model 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 models. We have also generated reduced models 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 model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 2.276271 4
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.302900 5