Abstract
The service time of the container vessels is the main indicator of the competitiveness of a maritime container terminal. This work proposes two Variable Neighbourhood Searches (VNS) in order to tackle the Tactical Berth Allocation Problem and the Quay Crane Scheduling Problem, which are the main operational problems in the seaside. These metaheuristics are integrated into a framework that provides an overall planning for the vessels arrived to port within a given time horizon. The performance of the proposed VNSs is compared with the most highlighted solution methods published in the related literature. In addition, the effectiveness of the framework is assessed in real size environments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
