A single product maritime inventory routing problem is addressed in this paper by exploring the use of continuous and discrete time models. We first present a continuous time model based on time slots for single docks, which is enhanced by reformulating the time assignment constraints. Next, we present a model based on event points to handle parallel docks. A discrete time is also presented based on a single commodity fixed-charge network flow problem (FCNF). All the models are solved for multiple randomly generated instances of different problems to compare their computational efficiency, and to illustrate the solutions obtained.
Alternative mixed-integer linear programming models of a maritime inventory routing problem
Computers & Chemical Engineering ; 77 ; 147-161
2015
15 Seiten, 27 Quellen
Article (Journal)
English
Robust Optimization for a Maritime Inventory Routing Problem
British Library Online Contents | 2018
|Indonesian Maritime Logistics Network Optimization Using Mixed Integer Programming
DOAJ | 2017
|A mixed-integer linear optimization problem for highway emergency vehicle routing
British Library Conference Proceedings | 2023
|Integer Linear Programming Formulations for the Fleet Quickest Routing Problem on Grids
BASE | 2022
|