We consider the Tramp Ship Routing and Scheduling Problem (TSRSP) in which we plan routes for a fleet of tramp shipping vessels operating on a combined contract and spot market. Earlier research has been fragmented due to variations in the side constraints studied. Hence we present the first unified model that can handle speed optimization, chartering costs, bunker planning, and hull cleaning. The model is solved by column generation, where the columns represent the possible routes of a vessel, while the master problem keeps track of the binding constraints. The pricing problem is solved efficiently using a time–space graph and several dominance rules. Real-life instances with up to 40 vessels, 35 geographic regions, and four months planning horizon can be solved to optimality in less than half an hour. The optimized routes increase earnings by 7% compared to historical schedules. Furthermore, policy-makers can use the model as a simulation of a rational agent behavior.
We consider the Tramp Ship Routing and Scheduling Problem (TSRSP) in which we plan routes for a fleet of tramp shipping vessels operating on a combined contract and spot market. Earlier research has been fragmented due to variations in the side constraints studied. Hence we present the first unified model that can handle speed optimization, chartering costs, bunker planning, and hull cleaning. The model is solved by column generation, where the columns represent the possible routes of a vessel, while the master problem keeps track of the binding constraints. The pricing problem is solved efficiently using a time–space graph and several dominance rules. Real-life instances with up to 40 vessels, 35 geographic regions, and four months planning horizon can be solved to optimality in less than half an hour. The optimized routes increase earnings by 7% compared to historical schedules. Furthermore, policy-makers can use the model as a simulation of a rational agent behavior.