Container Stowage Planning - k-shift instances - Roberti-Parenno
收藏DataCite Commons2023-07-11 更新2025-04-10 收录
下载链接：
https://data.dtu.dk/articles/dataset/Container_Stowage_Planning_-_k-shift_instances_-_Roberti-Parenno/22284475/1
下载链接
链接失效反馈官方服务：
资源简介：
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., & 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., & 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>
提供机构：
Technical University of Denmark
创建时间：
2023-03-20
