Universidad de Burgos RIUBU Principal Default Universidad de Burgos RIUBU Principal Default
  • español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
Universidad de Burgos RIUBU Principal Default
  • Ayuda
  • Entre em contato
  • Deixe sua opinião
  • Acceso abierto
    • Archivar en RIUBU
    • Acuerdos editoriales para la publicación en acceso abierto
    • Controla tus derechos, facilita el acceso abierto
    • Sobre el acceso abierto y la UBU
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Navegar

    Todo o repositórioComunidades e ColeçõesPor data do documentoAutoresTítulosAssuntosEsta coleçãoPor data do documentoAutoresTítulosAssuntos

    Minha conta

    EntrarCadastro

    Estatísticas

    Ver as estatísticas de uso

    Compartir

    Ver item 
    •   Página inicial
    • E-Prints
    • Untitled
    • Departamento de Economía Aplicada
    • Untitled
    • Untitled
    • Ver item
    •   Página inicial
    • E-Prints
    • Untitled
    • Departamento de Economía Aplicada
    • Untitled
    • Untitled
    • Ver item

    Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10259/6195

    Título
    Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
    Autor
    Parreño Torres, ConsueloAutoridad UBU Orcid
    Çalık, Hatice
    Álvarez-Valdés Olaguíbel, Ramón
    Ruiz García, Rubén
    Publicado en
    Computers & Operations Research. 2021, V. 133, 105383
    Editorial
    Elsevier
    Fecha de publicación
    2021-09
    ISSN
    0305-0548
    DOI
    10.1016/j.cor.2021.105383
    Resumo
    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.
    Palabras clave
    Container ship
    Multiport stowage
    Mathematical models
    Matheuristics
    Planning
    Materia
    Transportes
    Transportation
    Organización del trabajo
    Methods engineering
    Informática
    Computer science
    URI
    http://hdl.handle.net/10259/6195
    Versión del editor
    https://doi.org/10.1016/j.cor.2021.105383
    Aparece en las colecciones
    • Untitled
    Attribution-NonCommercial-NoDerivatives 4.0 Internacional
    Documento(s) sujeto(s) a una licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional
    Arquivos deste item
    Nombre:
    Parreño-cor_2021.pdf
    Tamaño:
    757.6Kb
    Formato:
    Adobe PDF
    Thumbnail
    Visualizar/Abrir

    Métricas

    Citas

    Academic Search
    Ver estadísticas de uso

    Exportar

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis
    Mostrar registro completo