Cemalettin OzturkF. Zeynep SargutM. Arslan OrnekDeniz Tursel Eliiyi2025-10-0620170308-88391464-525410.1080/03088839.2017.1341061http://dx.doi.org/10.1080/03088839.2017.1341061https://gcris.yasar.edu.tr/handle/123456789/6931Due to economical and/or geographical constraints most of the time overseas containers cannot be directly shipped to their destinations. These containers visit transhipment ports where they are first unloaded and temporarily stored and then loaded onto smaller vessels (feeders) to be transported to their final destinations. The assignment of these containers to outbound vessels necessitates several factors to be taken into account simultaneously. In this paper we develop a mathematical model to reflect multiple objectives with priorities and to assign these containers to different vessels at the transit container port terminal. Although we solve a single-objective (with the weighted sum of objectives) mathematical model to optimality we also propose two heuristic approaches to solve this complex problem for a transit agency. The first heuristic is shipment based and has four variants differing in how the opportunity costs of the assignments are calculated. The second greedy heuristic is trip based where the goal is to maximise the capacity utilisation of the vessels. The heuristics return very promising solutions in ignorable computational times. We also provide real-life cases and present our conclusions.EnglishContainer terminal operations, container assignment, optimisation, heuristic algorithm, integer programmingSUPPLY CHAIN, OPERATIONSArticle