MIXED INTEGER LINEAR PROGRAMMING APPLICATION IN A PROBLEM OF LOADING AND ROUTING OF TANKER VESSELS

This paper addresses a vessel scheduling problem involving the transportation of multiple
bulk liquids among geographically dispersed locations under contractual demand requirements. The
model jointly considers routing and loading decisions over a discrete planning horizon, in which
heterogeneous vessels are assigned to destinations and loaded in compliance with tank compatibility
and capacity constraints. The objective is to maximize total profit, defined as the revenues from
contracted deliveries plus the income obtained from volumes delivered in excess of contractual
demand, minus penalties incurred for unmet demand.