In this paper, we study a sea cargo mix problem that occurs in the context of container shipment planning and revenue analysis in ocean carriers. We describe structure and characteristics of the cargo mix problem, and formulate as a Multi-Dimension Multiple Knapsack Problem (MDMKP). In particular, the MDMKP is an optimization model that maximizes the total profit in several periods, subject to the limited shipping capacity and the limited number of empty containers in the origin port, etc. Algorithm is proposed to obtain the near optimal solution for the problem. Numerical experiments demonstrate the efficiency of the algorithm.
Ang, James S.K.; Cao, Chengxuan; and Ye, Hengqing, "Model and Algorithm for Sea Cargo Mix Problem" (2003). ICEB 2003 Proceedings. 130.