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:

Parreño-Torres, C., Çalık, H., Alvarez-Valdes, R., & Ruiz, R. (2021). Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. Computers and Operations Research, 133, 105383. https://doi.org/10.1016/j.cor.2021.105383

Roberti, R., & Pacino, D. (2018). A decomposition method for finding optimal container stowage plans. Transportation Science, 52(6), 1444–1462. https://doi.org/10.1287/trsc.2017.0795