Designing optimal routes in a liner shipping problem

In container liner shipping HUB-to-spoke networks are an important cost saving implementation. However in such a network designing optimal weekly sailing routes is of the utmost importance when minimizing transportation costs. In this paper we use a two pronged approach to tackle this cost minimization by implementing an algorithm that generates all feasible sailing routes. These feasible routes are then given as input to a Mixed Integer Program that minimizes costs while satisfying all container demand. More specifically we look at HUB-to-spoke networks in the WAF area in West-Africa and the Baltic area in North-Europe.