Show simple item record

dc.contributor.authorParreño Torres, Consuelo
dc.contributor.authorÇalık, Hatice
dc.contributor.authorÁlvarez-Valdés Olaguíbel, Ramón
dc.contributor.authorRuiz García, Rubén
dc.date.accessioned2021-11-19T13:02:24Z
dc.date.available2021-11-19T13:02:24Z
dc.date.issued2021-09
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/10259/6195
dc.description.abstractWe 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.en
dc.description.sponsorshipSpanish 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.en
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofComputers & Operations Research. 2021, V. 133, 105383en
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectContainer shipen
dc.subjectMultiport stowageen
dc.subjectMathematical modelsen
dc.subjectMatheuristicsen
dc.subjectPlanningen
dc.subject.otherTransportees
dc.subject.otherTransportationen
dc.subject.otherTrabajo-Organizaciónes
dc.subject.otherWork designen
dc.subject.otherInformáticaes
dc.subject.otherComputer scienceen
dc.titleSolving the generalized multi-port container stowage planning problem by a matheuristic algorithmen
dc.typeinfo:eu-repo/semantics/articlees
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.relation.publisherversionhttps://doi.org/10.1016/j.cor.2021.105383es
dc.identifier.doi10.1016/j.cor.2021.105383
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersiones


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record