RT info:eu-repo/semantics/article
T1 Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
A1 Parreño Torres, Consuelo
A1 Çalık, Hatice
A1 Álvarez-Valdés Olaguíbel, Ramón
A1 Ruiz García, Rubén
K1 Container ship
K1 Multiport stowage
K1 Mathematical models
K1 Matheuristics
K1 Planning
K1 Transporte
K1 Transportation
K1 Trabajo-Organización
K1 Work design
K1 Informática
K1 Computer science
AB We focus on a simplified container stowage planning problem where containers of different size and weight must be loaded and unloaded at multiple ports while maintaining the stability of the ship. We initially investigate how the difficulty in solving the problem changes with and without the consideration of container sizes and weight constraints. For this purpose, we provide integer programming formulations for the general problem as well as some special cases with identical container size and/or identical weights and evaluate their performance in randomly generated small- and medium-scale instances. We develop a matheuristic procedure, namely, an insert-and-fix heuristic, exploiting the special structure of the proposed formulations. The Insert-and-Fix method, in combination with a constructive algorithm that gives the solver an initial solution in each iteration, provides solutions with a low number of rehandles for instances with up to 5000 TEUs.
PB Elsevier
SN 0305-0548
YR 2021
FD 2021-09
LK http://hdl.handle.net/10259/6195
UL http://hdl.handle.net/10259/6195
LA eng
NO Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under the project “OPTEP-Port Terminal Operations Optimization” (No. RTI2018-094940-B-I00) financed with FEDER, Spain funds. The second author acknowledges the partial support by Data-driven logistics, Spain (FWO-S007318N) and Internal Funds KU Leuven, Spain.
DS Repositorio Institucional de la Universidad de Burgos
RD 19-abr-2024