Instance - eilC76-2

eilC76-2: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	J. Linderoth
Description:	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions.
	MIPLIB Entry


	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.

Decomposed These decomposed images were created by GCG.
Name	neos-3352863-ancoa [MIPLIB]	scpj4scip [MIPLIB]	scpk4 [MIPLIB]	eilA101-2 [MIPLIB]	sorrell4 [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.674	2 / 0.684	3 / 0.700	4 / 0.737	5 / 0.746
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.

Decomposed These decomposed images were created by GCG.
Name	eilA101-2 [MIPLIB]	eil33-2 [MIPLIB]	nw04 [MIPLIB]	ivu06 [MIPLIB]	ds-big [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.	4 / 0.737	13 / 0.855	99 / 1.614	211 / 2.034	215 / 2.039
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 eilC76-2, the five most similar instances to eilC76-2 according to the MIC, and the five most similar instances to eilC76-2 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	eilC76-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	neos-3352863-ancoa [MIPLIB]	Jeff Linderoth	(None provided)	0.673793	1
	scpj4scip [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	0.684341	2
	scpk4 [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	0.699898	3
	eilA101-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB	0.737120	4
	sorrell4 [MIPLIB]	Toni Sorrell	These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	0.745788	5
MIPLIB Top 5	eilA101-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB	0.737120	4
	eil33-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB	0.855257	13
	nw04 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.613786	99
	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.034150	211
	ds-big [MIPLIB]	Steffen Weider	Bus driver duty scheduling problem	2.039437	215

eilC76-2: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	eil
Assigned Model Group Rank/ISS in the MIC:	26 / 1.766

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	2hopcds	iis	assign1	f2gap	mod
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.970	2 / 1.089	3 / 1.117	4 / 1.176	5 / 1.256

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	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.	0.969786	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.088724	2
	assign1	Robert Fourer	Imported from the MIPLIB2010 submissions.	1.116659	3
	f2gap	Salim Haddadi	Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	1.175972	4
	mod	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.256069	5

eilC76-2: Instance-to-Instance Comparison Results

Parent Instance (eilC76-2)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

eilC76-2: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary