Container Pre-Marshalling Problem Under the Same-Group Exclusive Strategy

Container pre-marshalling problem (CPMP) has been widely studied. In the real world, containers are divided into multiple groups according to appointment time segments. Containers in different groups have determined priorities; while containers in the same group have uncertain priorities (intra-group priorities). By far, few scholars have studied CPMP with uncertain intra-group priorities. In this regard, this paper proposes a same-group exclusive (SGE) strategy and solves CPMP with uncertain intra-group under SGE (CPMP-SGE). For CPMP-SGE, this paper proposes two mathematical models and a target-guided greedy and correction (TGGC) algorithm. Numerical experiments are conducted on a commonly used dataset. The contributions of this paper are: we solve CPMP with the uncertain intra-group priority under the SGE strategy; we propose two mathematical models for CPMP-SGE; we develop feasibility conditions and design a TGGC algorithm for CPMP-SGE.