Abstract
Because the cost of berths and quay cranes are very high compared to the investment costs for the other facilities in container terminals, so berths and quay cranes are the most critical resources in determining the capacity of container terminals. In order to efficiently utilize berths and quay cranes, this paper studied the dynamic discrete berth allocation and quay crane scheduling problem considering the cost balance among different vessels. The objective of the proposed model is to reduce the cost of berths and quay cranes, including the handling cost, the waiting cost and the quay crane operation cost. Due to the inherent computation complexity, a genetic algorithm is designed to attain the near optimal solution. Computational experiments show that the two proposed algorithm are effective for solving the studied problem.
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.
