Mostrar el registro sencillo del ítem
dc.contributor.author | Jiménez-Piqueras, Celia![]() |
es_ES |
dc.contributor.author | Ruiz, Rubén![]() |
es_ES |
dc.contributor.author | Parreño-Torres, Consuelo![]() |
es_ES |
dc.contributor.author | Alvarez-Valdes, Ramon![]() |
es_ES |
dc.date.accessioned | 2024-04-11T07:53:53Z | |
dc.date.available | 2024-04-11T07:53:53Z | |
dc.date.issued | 2023-04-16 | es_ES |
dc.identifier.issn | 0377-2217 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/203326 | |
dc.description.abstract | [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. | es_ES |
dc.description.sponsorship | 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. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | European Journal of Operational Research | es_ES |
dc.rights | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | es_ES |
dc.subject | Logistics | es_ES |
dc.subject | Container terminal optimization | es_ES |
dc.subject | Premarshalling problem | es_ES |
dc.subject | Constraint programming | es_ES |
dc.title | A constraint programming approach for the premarshalling problem | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.ejor.2022.07.042 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094940-B-I00/ES/OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI//PRE2019-087706//AYUDA PREDOCTORAL AEI-JIMENEZ PIQUERAS. PROYECTO: OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat | es_ES |
dc.description.bibliographicCitation | Jiménez-Piqueras, C.; Ruiz, R.; Parreño-Torres, C.; Alvarez-Valdes, R. (2023). A constraint programming approach for the premarshalling problem. European Journal of Operational Research. 306(2):668-678. https://doi.org/10.1016/j.ejor.2022.07.042 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.ejor.2022.07.042 | es_ES |
dc.description.upvformatpinicio | 668 | es_ES |
dc.description.upvformatpfin | 678 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 306 | es_ES |
dc.description.issue | 2 | es_ES |
dc.relation.pasarela | S\484869 | es_ES |
dc.contributor.funder | AGENCIA ESTATAL DE INVESTIGACION | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Universitat Politècnica de València | es_ES |