This chapter examines two of the most important operational problems in seaport terminals, first, the berth allocation problem (BAP) which finds an optimal assignment of ships to the berths that minimise the total waiting time of all ships. Then we consider the ships containers to storage areas assignment problem (SSAP) which finds an allocation of ship containers to storage area that minimises the travelling time and containers dispersion. In the first step, a mixed integer linear program model is designed to address the BA problem with the aim of minimising the ships stay time in the port (known as the scheduling theory by the flow time). In a second step, the output of the first model is used in another mixed integer linear program model to solve the SSA problem with a view at reducing both travelling time and containers dispersion while satisfying storage capacities for the case where the containers of one ship can be partitioned into two different and consecutive storage area when needed. The experimental part is conducted on a real case, namely the Tunisian port of Radès.
Solving a mixed integer linear program approximation of the toll design problem using constraint generation within a branch-and-cut algorithm
