Container Stowage Planning - k-shift instances - Roberti-Parenno

This dataset includes all the instances for the k-shift container stowage planning problem from the papers: <br> Parreño-Torres, C., Çalık, H., Alvarez-Valdes, R., &amp; Ruiz, R. (2021). Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. <em>Computers and Operations Research</em>, <em>133</em>, 105383. https://doi.org/10.1016/j.cor.2021.105383 <br> Roberti, R., &amp; Pacino, D. (2018). A decomposition method for finding optimal container stowage plans. <em>Transportation Science</em>, <em>52</em>(6), 1444–1462. https://doi.org/10.1287/trsc.2017.0795 <br>

本数据集包含k-shift集装箱配载规划问题的所有实例，这些实例来源于以下两篇论文：<br>Parreño-Torres, C., Çalık, H., Alvarez-Valdes, R., & Ruiz, R. (2021). 《基于元启发式算法求解广义多港口集装箱配载规划问题》. <em>计算机与运筹学</em>, <em>133</em>, 105383. https://doi.org/10.1016/j.cor.2021.105383<br>Roberti, R., & Pacino, D. (2018). 《求解最优集装箱配载方案的分解方法》. <em>运输科学</em>, <em>52</em>(6), 1444–1462. https://doi.org/10.1287/trsc.2017.0795