Optimization of Continuous Berth and Quay Crane Allocation Problem in Seaport Container Terminal

This paper addresses the combined optimization of continuous berth and quay crane allocation problem in seaport container terminal. First, a formulation of the problem is set up, with the consideration of the prevention of QCs´ crossover and the demanded space between the two adjacent ships both in time and between berth locations. Next, a new construction heuristic method is proposed to find an optimal solution. At last, four sets of instances are generated for experiment. The results show the effectiveness and efficient of the heuristic method.