Pasar al contenido principal

OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS

PRE2019-087706

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Formación
Convocatoria Contratos Predoctorales
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
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 container premarshalling problem with an auxiliary bay

  • Jiménez-Piqueras, Celia
  • Tierney, Kevin
[EN] The relocation of containers is essential at port terminals to increase operational efficiency during container retrieval from the yard. When a container must be retrieved, any container placed on top of it must be moved to another stack, delaying the retrieval process. The container premarshalling problem (CPMP) aims to tackle this issue by finding a sequence of minimal container relocations to achieve a bay arrangement where no container needs to be moved during retrieval. The classical formulation of this problem assumes that all premarshalling relocations occur within the bay being arranged. However, this study demonstrates that practical applications of premarshalling can benefit from more efficient use of available resources. We introduce a novel problem variant that allows the use of an auxiliary bay as additional space for relocating containers during the arrangement process. We present constraint programming solution methods for this variant that reveal a significant reduction in premarshalling relocations when an auxiliary bay is used. The results demonstrate that bays where high occupancy rates prevent premarshalling can be successfully arranged with an auxiliary bay. Additionally, we propose two alternative formulations allowing different rates of relocations between bays, offering adaptability to varying port terminal requirements., This work was supported by the Spanish Ministry of Science and Innovation [PRE2019-087706] .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The container premarshalling problem under limited crane time: A constraint programming approach

  • Jiménez-Piqueras, Celia
  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramon
  • Ruiz García, Rubén
[EN] This study addresses the premarshalling problem when the crane time is limited and a complete rearrangement of the bay is not possible. This issue has been neglected in the literature, but it is very common in practice. We show that the use of standard approaches often fails to yield good solutions and develop a model for the problem in two steps. First, a constraint programming model is proposed for premarshalling with crane time minimization objective. Then, this model is adapted to the new problem. An extensive computational study shows that the first model improves on the performance of the existing state-of-the-art integer programming model and that the model of the new problem obtains high quality solutions even in short running times., This work was supported by the Spanish Ministry of Science and Innovation under predoctoral grant PRE2019-087706, under project "OPRES-Realistic Optimization in Problems in Public Health" (PID2 021-124975OB-I00) , and under project "Operations Research for Supply Chain Optimization Problems" (PID2021-125709OB-C21) , partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A constraint programming approach for the premarshalling problem

  • Jiménez-Piqueras, Celia
  • Ruiz, Rubén
  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramon
[EN] The enormous amount of containers handled at ports hampers the efficiency of terminal operations. The optimization of crane movements is crucial for speeding up the loading and unloading of vessels. To this end, the premarshalling problem aims to reorder a set of containers placed in adjacent stacks with a minimum number of crane movements, so that a container with an earlier retrieval time is not below one with a later retrieval time. In this study, we present a series of constraint programming models to optimally solve the premarshalling problem. Extensive computational comparisons show that the best proposed constraint programming formulation yields better results than the state-of-the-art integer programming approach. A salient finding in this paper is that the logic behind the model construction in constraint programming is radically different from that of more traditional mixed integer linear programming models., Acknowledgements This study has been partially supported by the Spanish Ministry of Science and Innovation under predoctoral grant PRE2019-087706 and the project 'OPTEP-Port Terminal Operations Opti-mization' (No. RTI2018-094940-B-I00) financed with FEDER funds.