Abstract
This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to integrate the berth template and the yard template planning with the aim to minimize the service cost that is incurred by the deviation from vessels' expected turnaround time intervals, and the operation cost that is related to the route length of transshipment container flows in yard. Moreover, a heuristic algorithm is developed for solving the problem in large-scale realistic environments. Numerical experiments are conducted to prove the necessity of the proposed model and also validate the efficiency of the proposed heuristic algorithm. For a set of real-world like instances, the heuristic algorithm can obtain good berth and yard templates within a reasonable time.
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.
