Instance - lr1dr02vc05v8a-t360

lr1dr02vc05v8a-t360: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Dimitri Papageorgiou
Description:	Maritime Inventory Routing Problem Library - Group 2 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. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour.
	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	f2gap201600 [MIPLIB]	wnq-n100-mw99-14 [MIPLIB]	neos-4382714-ruvuma [MIPLIB]	tw-myciel4 [MIPLIB]	graphdraw-opmanager [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.484	2 / 1.594	3 / 1.603	4 / 1.620	5 / 1.653
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	qnet1_o [MIPLIB]	qnet1 [MIPLIB]	atlanta-ip [MIPLIB]	lr1dr12vc10v70b-t360 [MIPLIB]	lr1dr04vc05v17a-t360 [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.	20 / 1.720	425 / 2.250	535 / 2.301	610 / 2.333	721 / 2.377
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 lr1dr02vc05v8a-t360, the five most similar instances to lr1dr02vc05v8a-t360 according to the MIC, and the five most similar instances to lr1dr02vc05v8a-t360 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	lr1dr02vc05v8a-t360 [MIPLIB]	Dimitri Papageorgiou	Maritime Inventory Routing Problem Library - Group 2 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. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour.	0.000000	-
MIC Top 5	f2gap201600 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	1.483821	1
	wnq-n100-mw99-14 [MIPLIB]	M. Winkler	Weighted n-queens problem with an additional separation constraint. Solved by Gurobi 4.6.1 (12 threads) in 28124 seconds (January 2012).	1.593738	2
	neos-4382714-ruvuma [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.603424	3
	tw-myciel4 [MIPLIB]	Arie Koster	Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database. Solved in June 2013 by CPLEX 12.5.1 (12 threads) in about 66 hours. The solving was performed in two steps: first solving with 50 GB tree memory limit (took 11307.42 seconds), after that, setting the tree memory limit to 80 GB and switching to depth first search (took 226152.14 seconds).	1.620163	4
	graphdraw-opmanager [MIPLIB]	Cézar Augusto Nascimento e Silva	In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\$i\$) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\$ii\$) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem.	1.653139	5
MIPLIB Top 5	qnet1_o [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.719817	20
	qnet1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	2.249998	425
	atlanta-ip [MIPLIB]	E-Plus, D. Bienstock, A. Bley, R. Wessäly	Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions	2.301471	535
	lr1dr12vc10v70b-t360 [MIPLIB]	Dimitri Papageorgiou	Maritime Inventory Routing Problem Library - Group 2 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. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour.	2.333289	610
	lr1dr04vc05v17a-t360 [MIPLIB]	Dimitri Papageorgiou	Maritime Inventory Routing Problem Library - Group 2 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. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour.	2.376948	721

lr1dr02vc05v8a-t360: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	maritime
Assigned Model Group Rank/ISS in the MIC:	156 / 3.325

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	timetabling	f2gap	pb-	neos-pseudoapplication-103	neos-pseudoapplication-66
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.213	2 / 2.275	3 / 2.392	4 / 2.418	5 / 2.491

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	timetabling	George Fonseca	Educational timetabling problems from several real schools/universities around the world. These models were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2].	2.212728	1
	f2gap	Salim Haddadi	Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	2.275314	2
	pb-	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.391658	3
	neos-pseudoapplication-103	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	2.418385	4
	neos-pseudoapplication-66	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.491467	5

lr1dr02vc05v8a-t360: Instance-to-Instance Comparison Results

Parent Instance (lr1dr02vc05v8a-t360)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

lr1dr02vc05v8a-t360: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary