Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving the generalized multi-port container stowage problem by a matheuristic algorithm

  • Parreño-Torres, Consuelo
  • Calik, Hatice
  • Álvarez-Valdés, Ramón
  • Ruiz García, Rubén
[EN] 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., We would like to thank the anonymous referees for their comments which have helped to significantly improve this paper. This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under theproject "OPTEPPort Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER, Spain funds. The second author acknowledges the partial support by Datadriven logistics, Spain (FWO-S007318N) and Internal Funds KU Leuven, Spain.
Repositorio Institucional de la Universidad de Burgos (RIUBU)
Publicación Artículo científico (JournalArticle)

Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm

  • Parreño Torres, Consuelo
  • Çalık, Hatice
  • Álvarez-Valdés Olaguíbel, Ramón
  • Ruiz García, Rubén
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., 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.