Berth Allocation Problem With The Preferences Of Berthing Position

The scale of waterway transportation has grown rapidly under the economic globalization,and the demand for automated construction of terminals has become increasingly strong.The goal of Berth Allocation problem is to reasonably allocate the berthing position and operation time to the ships operating at the terminal,so as to improve the overall work efficiency of the terminal.In the process of terminal operations,ships often have a preference for the berthing position,so this paper focuses on Berth Allocation Problem with the preferences of berthing position according to actual condition.Chapter 1 introduces the development of container terminals and the research status of BAP.Chapter 2 studies the BAP with the preferences of berthing position under static arrival time,and introduces the transformation process from the BAP with the preferences of berthing position to the two-dimensional bin packing problem.Based on this problem,a mixed integer linear programming model is established,and the Gurobi solver is used to solve it.Chapter 2 uses Beam Search to combine the two binning strategies to design a new heuristic algorithm.Numerical experiments show that the solution time of the heuristic algorithm does not exceed 10% of Gurobi’s,while the average deviation percentage is less than 5%.Chapter 3 studies the joint berth-crane allocation problem under the dynamic arrival time of ships,and the corresponding integer linear programming model is established.Gurobi is used to solve the model and we visualize the results.In order to reduce the solution time,a new solution scheme based on genetic algorithm is designed and we expound the design ideas of key steps.Numerical experimental results prove the effectiveness of the genetic algorithm,the average deviation percentage is not more than11% with the solution time is only 10% of Gurobi’s.