Abstract This chapter presents an extensive computational study of simple, but prominent matheuristics (i.e., heuristics that rely on mathematical programming models) to find high quality ship schedules and inventory policies for a class of maritime inventory routing problems. Our computational experiments are performed on a test bed of the publicly available MIRPLib instances. This class of inventory routing problems has few constraints relative to some operational problems, but is complicated by long planning horizons. We compare several variants of rolling horizon heuristics, K-opt heuristics, local branching, solution polishing, and hybrids thereof. Many of these matheuristics substantially outperform the commercial mixed-integer programming solvers CPLEX 12.6.2 and Gurobi 6.5 in their ability to quickly find high quality solutions. New best known incumbents are found for 26 out of 70 yet-to-be-proved-optimal instances and new best known bounds on 56 instances.
Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing
2017-09-05
36 pages
Article/Chapter (Book)
Electronic Resource
English
TIBKAT | 2025
|Robust Optimization for a Maritime Inventory Routing Problem
British Library Online Contents | 2018
|Improving maritime inventory routing: application to a Brazilian petroleum case
Taylor & Francis Verlag | 2017
|Maritime Inventory Routing Problem Considering Weather Conditions and Tide at Ports
Transportation Research Record | 2022
|