Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

Dimitri Papageorgiou | 20810 | 7560 | 3.74705e-04 | open | maritime | 123046.81493703081* | lr1dr02vc05v8a-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.

Detailed explanation of the following tables can be found here.

Original | Presolved | |
---|---|---|

Variables | 20810 | 19255 |

Constraints | 7560 | 7351 |

Binaries | 12174 | 14022 |

Integers | 6471 | 3073 |

Continuous | 2165 | 2160 |

Implicit Integers | 0 | 0 |

Fixed Variables | 905 | 0 |

Nonzero Density | 0.000374705 | 0.000395970 |

Nonzeroes | 58950 | 56047 |

Original | Presolved | |
---|---|---|

Total | 7560 | 7351 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 2 |

Precedence | 0 | 0 |

Variable Bound | 0 | 7 |

Set Partitioning | 6 | 100 |

Set Packing | 0 | 1064 |

Set Covering | 0 | 0 |

Cardinality | 2154 | 2018 |

Invariant Knapsack | 0 | 0 |

Equation Knapsack | 0 | 0 |

Bin Packing | 0 | 0 |

Knapsack | 0 | 0 |

Integer Knapsack | 1080 | 0 |

Mixed Binary | 0 | 1078 |

General Linear | 4320 | 3082 |

Indicator | 0 | 0 |

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

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

value | min | median | mean | max | |
---|---|---|---|---|---|

Components | 0.903090 | ||||

Constraint % | 0.0136036 | 10.1230 | 14.0389 | 14.3654 | |

Variable % | 0.0103799 | 12.6776 | 17.5265 | 18.0455 | |

Score | 0.582897 |

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 | |
---|---|---|---|---|---|---|---|---|---|

3 | 4 | 123046.8 | 123046.8 | 1.3e-06 | 0e+00 | 0 | Edward Rothberg | 2020-04-22 | Obtained with Gurobi 9.0 using the solution improvement heuristic |

1 | 3 | 126533.4 | 0.0e+00 | 0e+00 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 | |

4 | 2 | 134358.1 | 0.0e+00 | 9e-07 | 0 | Robert Ashford and Alkis Vazacopoulus | 2019-12-18 | Found using ODH|CPlex | |

2 | 1 | 195940.3 | 195940.3 | 0.0e+00 | 0e+00 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to lr1dr02vc05v8a-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.

```
@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}
}
```

Last Update Mai 20, 2021 by Philipp Wellner

generated with R Markdown

© 2020 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint