bab6

benchmark binary benchmark_suitable aggregations precedence set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Elmar Swarat 114240 29904 3.75613e-04 hard bab -284248.2307 bab6.mps.gz

Vehicle routing with profit and an integrated crew scheduling like bab2 … bab5. Instances 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.

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 114240 114240
Constraints 29904 29904
Binaries 114240 114240
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000375613 0.000375613
Nonzeroes 1283180 1283180
Constraint Classification Properties
Original Presolved
Total 29904 29904
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 340 340
Precedence 1908 1908
Variable Bound 0 0
Set Partitioning 8373 16805
Set Packing 1155 1155
Set Covering 0 6
Cardinality 9908 1476
Invariant Knapsack 7250 7259
Equation Knapsack 840 840
Bin Packing 0 0
Knapsack 24 8
Integer Knapsack 0 0
Mixed Binary 106 107
General Linear 0 0
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 0.30103
Constraint % 100 100 100 100
Variable % 100 100 100 100
Score 0.00000

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 -284248.2 -284248.2 0 0 0 - 2018-10-10 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to bab6 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
bab2 hard 147912 147912 0 0 17245 2027730 Elmar Swarat bab -357544.3115 benchmark binary decomposition benchmark_suitable aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
bab5 easy 21600 21600 0 0 4964 155520 Elmar Swarat bab -106411.8401 binary decomposition benchmark_suitable aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
rail01 easy 117527 117527 0 0 46843 392086 Thomas Schlechte rail0 -70.5699643 benchmark binary benchmark_suitable aggregations variable_bound set_partitioning set_packing cardinality knapsack
rail03 hard 758775 758775 0 0 253905 1728450 Thomas Schlechte rail0 -867.093965444446 binary numerics aggregations variable_bound set_partitioning set_packing cardinality knapsack
rail02 easy 270869 270869 0 0 95791 756228 Thomas Schlechte rail0 -200.4499077 benchmark binary benchmark_suitable aggregations set_partitioning set_packing cardinality

Reference

No bibliographic information available

Last Update Mär 19, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint