Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/78451
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorXu, Zen_US
dc.creatorLee, CYen_US
dc.date.accessioned2018-09-28T01:16:35Z-
dc.date.available2018-09-28T01:16:35Z-
dc.identifier.issn0030-364xen_US
dc.identifier.urihttp://hdl.handle.net/10397/78451-
dc.language.isoenen_US
dc.publisherInstitute for Operations Research and the Management Sciencesen_US
dc.rights© 2018 INFORMSen_US
dc.rightsThis is the accepted manuscript of the following article: Xu, Z., & Lee, C. Y. (2018). New lower bound and exact method for the continuous berth allocation problem. Operations Research, 66(3), 778-798, which has been published in final form at https://doi.org/10.1287/opre.2017.1687en_US
dc.subjectContinuous berth allocationen_US
dc.subjectLower bounden_US
dc.subjectBranch and bounden_US
dc.subjectExact methoden_US
dc.titleNew lower bound and exact method for the continuous berth allocation problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage778en_US
dc.identifier.epage798en_US
dc.identifier.volume66en_US
dc.identifier.issue3en_US
dc.identifier.doi10.1287/opre.2017.1687en_US
dcterms.abstractWe study a continuous berth allocation problem, where incoming vessels need to be assigned a mooring time as well as a berth location on a quay. It is a crucial element in port planning to achieve quick turnaround time for vessels. To solve this problem, many solution methods have been developed in the literature. However, gaps between the best-known lower and upper bounds on its optimal solutions are far from close. In this paper, we propose new and more effective solution methods for this important problem. By introducing a novel relaxation of the problem, we have derived a new lower bound that can be computed efficiently in quadratic time. By incorporating this new lower bound with some new heuristic and pruning techniques, we have developed a new exact method, based on a branch-and-bound approach. To demonstrate general applicability of the proposed methods, we have extended them to a more complicated problem, where decisions on berth allocations are restricted by a quay crane constraint. Extensive computational results have shown that, compared with previous state-of-the-art methods, our new methods have significantly reduced gaps between the lower and upper bounds and have solved more and larger instances to optimality in significantly less time. We have also performed sensitivity tests to demonstrate how robust the new solutions are against uncertainties in particular input parameters.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationOperations research, May-June 2018, v. 66, no. 3, p. 778-798en_US
dcterms.isPartOfOperations researchen_US
dcterms.issued2018-05-
dc.identifier.isiWOS:000441553700013-
dc.identifier.eissn1526-5463en_US
dc.identifier.rosgroupid2017005779-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journalen_US
dc.description.validate201809 bcrcen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0313-
dc.description.fundingSourceRGCen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS24926497-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Xu_New_Lower_Bound.pdfPre-Published version1.07 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

123
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

79
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

15
Citations as of Mar 22, 2024

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.