Abstract
This study investigates a problem regarding simultaneous allocations of berths, quay cranes, and yards in transshipment hubs. Transshipment and import/export activities, general quay crane assignment decisions, and productivity losses incurred by quay crane interference are considered. A mixed-integer programming model is proposed to minimize the total cost, including speed-up cost, delay cost, penalty cost of vessels, and operational cost on container loading and unloading. An iterative heuristic is developed to solve the proposed model. Extensive numerical experiments are conducted to validate the effectiveness of the proposed model and the efficiency of the algorithm.
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.
