lr1dr12vc10v70b-t360

aggregations variable_bound set_partitioning set_packing integer_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Dimitri Papageorgiou	193525	56160	5.40192e-05	open	maritime	1000790.979722782*	lr1dr12vc10v70b-t360.mps.gz

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.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	193525	181369
Constraints	56160	54677
Binaries	90670	123667
Integers	93480	48342
Continuous	9375	9360
Implicit Integers	0	0
Fixed Variables	7815	0
Nonzero Density	5.40192e-05	5.71020e-05
Nonzeroes	587100	566264

Constraint Classification Properties
	Original	Presolved
Total	56160	54687
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	11
Precedence	0	0
Variable Bound	0	55
Set Partitioning	0	481
Set Packing	0	4229
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	4680	370
Mixed Binary	0	4309
General Linear	51480	45232
Indicator	0	0

Structure

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

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components	1.113943
Constraint %		1.34609	1.37459	1.36803	1.47777
Variable %		4.01596	4.18288	4.18959	4.30809
Score	0.158054

Best Known Solution(s)

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

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion

ID	Objective	Exact	Int. Viol	Cons. Viol	Obj. Viol	Submitter	Date	Description
2	1000791	1000791	0	0	0	Mars Davletshin	2024-06-26	They were obtained with Optverse using solution improvement heuristic.
1	1166517		0	0	0	Robert Ashford and Alkis Vazacopoulus	2019-12-18	Found using ODH\|CPlex

Similar instances in collection

The following instances are most similar to lr1dr12vc10v70b-t360 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
lr1dr04vc05v17a-t360	open	36912	15326	17979	3607	12600	107170	Dimitri Papageorgiou	maritime	252463.0*	aggregations variable_bound set_partitioning set_packing integer_knapsack mixed_binary general_linear
lr1dr02vc05v8a-t360	open	20810	12174	6471	2165	7560	58950	Dimitri Papageorgiou	maritime	123046.8149370308*	aggregations variable_bound set_partitioning set_packing cardinality mixed_binary general_linear
neos-4703857-ahuroa	easy	266502	133470	0	133032	221496	536040	Jeff Linderoth	neos-pseudoapplication-82	7868280750.275999	numerics aggregations variable_bound mixed_binary general_linear
csched010	easy	1758	1457	0	301	351	6376	Tallys Yunes	csched	407.999999999994	benchmark_suitable aggregations variable_bound set_partitioning general_linear
triptim1	easy	30055	20456	9592	7	15706	515436	MIPLIB submission pool	triptim	22.8680999999999	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear

Reference

@article{papageorgiou2014mirplib,
  title={MIRPLib--A library of maritime inventory routing problem instances: Survey, core model, and benchmark results},
  author={Papageorgiou, Dimitri J and Nemhauser, George L and Sokol, Joel and Cheon, Myun-Seok and Keha, Ahmet B},
  journal={European Journal of Operational Research},
  volume={235},
  number={2},
  pages={350--366},
  year={2014},
  publisher={Elsevier}
}

@article{papageorgiou2014approximate,
  title={Approximate dynamic programming for a class of long-horizon maritime inventory routing problems},
  author={Papageorgiou, Dimitri J and Cheon, Myun-Seok and Nemhauser, George and Sokol, Joel},
  journal={Transportation Science},
  volume={49},
  number={4},
  pages={870--885},
  year={2014},
  publisher={INFORMS}
}