Instance - maritime-jg3d9

maritime-jg3d9: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Dimitri Papageorgiou
Description:	Maritime Inventory Routing Problems: Jiang-Grossmann 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. They involve a single product maritime inventory routing problem and explore the use of continuous and discrete time models. A continuous-time model based on time slots for single docks is used for some instances. A model based on event points to handle parallel docks is used in others. A discrete time model based on a single commodity fixed-charge network flow problem (FCNF) is used for other instances. All the models are solved for multiple randomly generated instances of different problems to compare their computational efficiency.
	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	markshare1 [MIPLIB]	stein15inf [MIPLIB]	markshare2 [MIPLIB]	markshare_5_0 [MIPLIB]	ns2124243 [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.166	2 / 1.175	3 / 1.176	4 / 1.186	5 / 1.192
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-5093327-huahum [MIPLIB]	neos-5041822-cockle [MIPLIB]	neos-5100895-inster [MIPLIB]	neos-5076235-embley [MIPLIB]	neos-5079731-flyers [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.	264 / 1.448	436 / 1.566	463 / 1.581	513 / 1.616	526 / 1.627
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 maritime-jg3d9, the five most similar instances to maritime-jg3d9 according to the MIC, and the five most similar instances to maritime-jg3d9 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	maritime-jg3d9 [MIPLIB]	Dimitri Papageorgiou	Maritime Inventory Routing Problems: Jiang-Grossmann 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. They involve a single product maritime inventory routing problem and explore the use of continuous and discrete time models. A continuous-time model based on time slots for single docks is used for some instances. A model based on event points to handle parallel docks is used in others. A discrete time model based on a single commodity fixed-charge network flow problem (FCNF) is used for other instances. All the models are solved for multiple randomly generated instances of different problems to compare their computational efficiency.	0.000000	-
MIC Top 5	markshare1 [MIPLIB]	G. Cornuéjols, M. Dawande	Market sharing problem	1.166132	1
	stein15inf [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.174701	2
	markshare2 [MIPLIB]	G. Cornuéjols, M. Dawande	Market sharing problem	1.176261	3
	markshare_5_0 [MIPLIB]	G. Cornuéjols, M. Dawande	Market sharing problem	1.185740	4
	ns2124243 [MIPLIB]	Timo Berthold	Instance coming from the NEOS Server with unknown application	1.192303	5
MIPLIB Top 5	neos-5093327-huahum [MIPLIB]	Jeff Linderoth	(None provided)	1.448400	264
	neos-5041822-cockle [MIPLIB]	Jeff Linderoth	(None provided)	1.565554	436
	neos-5100895-inster [MIPLIB]	Jeff Linderoth	(None provided)	1.581015	463
	neos-5076235-embley [MIPLIB]	Jeff Linderoth	(None provided)	1.615550	513
	neos-5079731-flyers [MIPLIB]	Jeff Linderoth	(None provided)	1.626690	526

maritime-jg3d9: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	maritime
Assigned Model Group Rank/ISS in the MIC:	231 / 4.252

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	markshare	scp	stein	neos-pseudoapplication-21	hypothyroid
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.688	2 / 1.714	3 / 1.770	4 / 1.823	5 / 1.888

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.687648	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.713605	2
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.769663	3
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.822938	4
	hypothyroid	Gleb Belov	Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38	1.888016	5

maritime-jg3d9: Instance-to-Instance Comparison Results

Parent Instance (maritime-jg3d9)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

maritime-jg3d9: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary