Model Group - bab

bab

Type:	Model Group
Submitter:	Elmar Swarat
Description:	Vehicle routing with profit and an integrated crew scheduling like bab2 - bab5. Models differ in multi-commodity-flow formulation (path oder arc formulation) or time discretization and some are quite easy to solve while others (bab2, bab3 and bab6) are very difficult.


	Model Group Composite (MGC) image Composite of the decomposed CCM images for every instance in the query model group.

	These are component instance images.
	Name	bab1	bab3	bab2	bab5	bab6

	FIXME - These are model group composite images.
	Name	neos-pseudoapplication-51	iis	maxfeassub	neos-pseudoapplication-106	graphdraw
	Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query model group and all other model groups. A smaller ISS value indicates greater similarity.	1 / 1.979	2 / 2.003	3 / 2.046	4 / 2.085	5 / 2.107

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Model Group	bab	Elmar Swarat	Vehicle routing with profit and an integrated crew scheduling like bab2 - bab5. Models differ in multi-commodity-flow formulation (path oder arc formulation) or time discretization and some are quite easy to solve while others (bab2, bab3 and bab6) are very difficult.	0.000000	-
MIC Top 5	neos-pseudoapplication-51	NEOS Server Submission	Model coming from the NEOS Server with unknown application	1.979203	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.	2.002544	2
	maxfeassub	Marc Pfetsch	Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball.	2.045840	3
	neos-pseudoapplication-106	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	2.085409	4
	graphdraw	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 model, 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.	2.106867	5

Web Analytics Made Easy -
StatCounter