Show simple item record

dc.contributor.authorFernández Areizaga, Elena 
dc.contributor.authorMuñoz Márquez, Manuel 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2022-01-12T12:52:44Z
dc.date.available2022-01-12T12:52:44Z
dc.date.issued2022-04
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860 (internet)
dc.identifier.urihttp://hdl.handle.net/10498/25967
dc.description.abstractThis paper develops new formulations for the Strategic Berth Template Problem, which combines strategic and operational decisions for medium-term berth planning of a given set of cyclically calling ships. The strategic decisions determine the ship calls that will be served, whereas the operational ones establish the berth template that will be applied in a cyclic fashion in the planning horizon. The proposed formulations use binary variables that classify served ships depending on whether or not their service starts in their arrival cycle or in the next one. This helps modeling the problem, since a closed linear expression can be obtained for the waiting times. Constraints imposing that the availability of the berths is respected at each time period can be derived by defining additional binary variables pointing to the starting service times of the served ships. Aggregating such variables over all berths leads to a relaxed formulation, which can be solved in remarkably small computing times. Furthermore, the solution of an auxiliary subproblem produces feasible solutions to the original problem as well as a simple optimality check. Disaggregating the initial service time variables for the different berths leads to a valid formulation. Numerical results from extensive computational tests over a set of benchmark instances from the literature are presented and analyzed. The obtained results assess the excellent performance of the proposed formulations, which outperform existing ones. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )es_ES
dc.description.sponsorshipThis research was partially funded by the Spanish Ministry of Economy and Competitiveness and ERDF funds [Grant PID2019-105824GB-I0 0 (MINECO/FEDER) ] . This support is gratefully ac-knowledged. The authors are thankful to Eduardo Lalla-Ruiz who kindly made available to us the set of benchmark instances.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherELSEVIERes_ES
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceEuropean Journal of Operational Research 298 (2022) 99–117es_ES
dc.subjectCombinatorial optimizationes_ES
dc.subjectMaritime transportationes_ES
dc.subjectStrategic berth allocationes_ES
dc.titleNew formulations and solutions for the strategic berth template problemes_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/j.ejor.2021.06.062
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-105824GB-I00/ES/OPTIMIZACION MATEMATICA Y COMBINATORIA EN REDES/es_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución 4.0 Internacional
This work is under a Creative Commons License Atribución 4.0 Internacional