Instance - minutedispatchstrategy


	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	f2gap40400 [MIPLIB]	scpm1 [MIPLIB]	gen-ip002 [MIPLIB]	gen-ip054 [MIPLIB]	gen-ip016 [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.235	2 / 1.320	3 / 1.327	4 / 1.355	5 / 1.360
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	neos-4232544-orira [MIPLIB]	neos-4292145-piako [MIPLIB]	neos-4264598-oueme [MIPLIB]	neos-4358725-tagus [MIPLIB]	bharat [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.	347 / 1.641	388 / 1.653	459 / 1.685	495 / 1.707	698 / 1.850
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 minutedispatchstrategy, the five most similar instances to minutedispatchstrategy according to the MIC, and the five most similar instances to minutedispatchstrategy according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	minutedispatchstrategy [MIPLIB]	Mark Husted	Dispatch Strategy for a small micro-grid	0.000000	-
MIC Top 5	f2gap40400 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	1.234571	1
	scpm1 [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.320497	2
	gen-ip002 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.326730	3
	gen-ip054 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.355352	4
	gen-ip016 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. Solved with XPRESS in a few seconds.	1.360498	5
MIPLIB Top 5	neos-4232544-orira [MIPLIB]	Jeff Linderoth	(None provided)	1.640526	347
	neos-4292145-piako [MIPLIB]	Jeff Linderoth	(None provided)	1.653066	388
	neos-4264598-oueme [MIPLIB]	Jeff Linderoth	(None provided)	1.684521	459
	neos-4358725-tagus [MIPLIB]	Jeff Linderoth	(None provided)	1.706562	495
	bharat [MIPLIB]	Gavin Goodall	MILP for optimizing fuel use at a forward operating base	1.849577	698

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	enlight	scp	neos-pseudoapplication-40	neos-pseudoapplication-21	stein
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.801	2 / 1.809	3 / 1.834	4 / 1.921	5 / 2.036

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	enlight	A. Zymolka	Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions.	1.800793	1
	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	1.809197	2
	neos-pseudoapplication-40	Jeff Linderoth	(None provided)	1.834374	3
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.921039	4
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	2.036248	5

Type:	Instance
Submitter:	Mark Husted
Description:	Dispatch Strategy for a small micro-grid
	MIPLIB Entry

Model Group Assignment from MIPLIB:	no model group assignment
Assigned Model Group Rank/ISS in the MIC:	N.A. / N.A.

minutedispatchstrategy: Instance-to-Instance Comparison Results

Parent Instance (minutedispatchstrategy)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

minutedispatchstrategy: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary