lr1dr04vc05v17a-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	36912	12600	2.30428e-04	open	maritime	252463.0*	lr1dr04vc05v17a-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	36912	34601
Constraints	12600	12330
Binaries	15326	20593
Integers	17979	10408
Continuous	3607	3600
Implicit Integers	0	0
Fixed Variables	1507	0
Nonzero Density	0.000230428	0.000241942
Nonzeroes	107170	103220

Constraint Classification Properties
	Original	Presolved
Total	12600	12334
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	4
Precedence	0	0
Variable Bound	0	27
Set Partitioning	0	98
Set Packing	0	1400
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	1800	364
Mixed Binary	0	1436
General Linear	10800	9005
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	2.562293
Constraint %		0.0081100	0.0719009	0.0081100	5.83131
Variable %		0.0144425	0.1996800	0.0722126	12.16060
Score	0.233988

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
6	252463.2	252463.2	0.0e+00	0e+00	0.0000000	Mars Davletshin	2024-06-26	They were obtained with Optverse using solution improvement heuristic.
5	252463.4	252463.4	0.0e+00	0e+00	0.0004847	Mou Sun, Tao Li, Wotao Yin	2023-12-22	Results computed using an adapted CPLEX with a 2-hour limit; details in the report “MindOpt Adapter for CPLEX Benchmarking Performance Analysis” (arXiv preprint: 2312.13527, 2023).
4	252463.4	252463.4	1.3e-06	8e-07	0.0000000	Michael Winkler	2022-03-28	Obtained with Gurobi 9.5.1
3	253167.8		7.0e-07	0e+00	0.0000000	Edward Rothberg	2019-12-13	Obtained with Gurobi 9.0
2	254971.6		0.0e+00	0e+00	0.0000000	Robert Ashford and Alkis Vazacopoulus	2019-12-18	Found using ODH\|CPlex
1	416992.4	416992.4	0.0e+00	0e+00	0.0000000	-	2018-10-12	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to lr1dr04vc05v17a-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
lr1dr12vc10v70b-t360	open	193525	90670	93480	9375	56160	587100	Dimitri Papageorgiou	maritime	1000790.979722782*	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
csched010	easy	1758	1457	0	301	351	6376	Tallys Yunes	csched	407.999999999994	benchmark_suitable aggregations variable_bound set_partitioning general_linear
neos-1067731	easy	8779	6330	0	2449	3423	30998	NEOS Server Submission	neos-pseudoapplication-11	1025102	benchmark_suitable aggregations set_partitioning mixed_binary
csched007	easy	1758	1457	0	301	351	6379	Tallys Yunes	csched	350.9999999999955	benchmark benchmark_suitable aggregations variable_bound set_partitioning mixed_binary 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}
}