Application of the minimum cost flow problem in container shipping

In this paper the efficient algorithm for optimal cargo transport of N types of containers with limited ship capacity, minimizing the transport costs, is being developed. It can be applied for transport planning on a voyage route with multiple loading ports and multiple ports of discharge. The problem is solved with network optimization approach that can be seen as the Minimum Cost Multi-Commodity Flow Problem (MCMCF). The implemented algorithm is able to find appropriate load planning sequence and to ensure minimal loading, discharging and transshipment costs, but with fulfillment of cargo demands in a number of destination ports on the voyage route. Application of this efficient tool may significantly reduce transport costs and ensure maximal possible profit. It may improve the operation process in maritime transport technology.