A Multi-product Maritime Inventory Routing Problem with Undedicated Compartments
This paper considers the problem of routing bulk tankers to minimize cost while managing the inventory in ports. Multiple non-mixable products are transported and the allocation of products to undedicated compartments onboard the ships is an important aspect of the problem. A mixed integer programming formulation of the problem is proposed, and the model is strengthened by including several valid inequalities. Computational results are reported for an evaluation of the model and the valid inequalities. Results are also reported for two simplified models where either the compartments are dedicated or the products are mixable.