Research On The Optimization Of The Integrated Berth Allocation And Quay Crane Assignment Problem

As modern logistics transportation hubs,ports play an irreplaceable role in economic development.In the face of increasing marine transportation demand,how to allocate the berth and quay cranes in ports reasonably and improve handling efficiency has become a huge challenge.Therefore,this thesis studies the integrated berth allocation and quay crane assignment problem,aiming at speeding up the vessels’ turnover.First of the all,this thesis proposes a heuristic method for the integrated berth allocation and quay crane assignment problem with vessels’ dynamic arrival and continuous berth without discretization of berth and time based on the analysis of the characteristics of the problem,which improves the accuracy of the solving method.From the perspective of constraint handling,four constraint handling strategies are proposed to combine with genetic algorithm for solving the problem.The influence of different constraint handling strategies on the performance of the algorithm for solving the problem is compared and analyzed.Then,this thesis establishes a mixed integer nonlinear programming model of the integrated berth allocation and quay crane assignment problem considering the non-crossing constraint and specific assignment of quay cranes,aiming at minimizing the total stay time of vessels in port,and proposes a two-stage heuristic method to solve it.This thesis applies the multi-objective constraint handing strategy to solve the problem,the original single-objective model with complex constraints is thereby transforming into a dual-objective model with only simple constraints.In addition,four constraint handing strategies are designed for the specific problem,and the test results on numerous instances show that the multiobjective constraint handling-based method is more efficient and stable than the single-objective constraint handling-based methods.Finally,to obtain an efficient integrated berth allocation and quay crane assignment scheme in uncertain environment where the arrival times of the vessels are stochastic,a stochastic programming model is established based on scenarios set in this thesis.An enhanced fast non-dominated sorting genetic algorithm is proposed to solve the problem,which combines the neighborhood search algorithm and the selection preference mechanism.Numerical experiment results show that this method can significantly improve the local exploitation ability.Figures 19,tables 14,references 93...