Optimization Of Yard Template With Traffic Congestion Constrain In Export Containers Terminal

With the rapid development and progress of the global economy,international and regional trade are on the rise,but at the same time,the contradiction between the spatial resources of the port yard and the container throughput of the terminal is also increasing.This thesis investigates the containers storage allocation in land-scare terminal.By optimizing the layout of outbound containers yard,maritime terminal can take full advantages of spatial resources.In the first chapter of this thesis,the current development status of international maritime logistics and the layout of container yard resources are introduced.Then,literature reviews according to the different rules and methods of container storage in the yard are discussed.In the second chapter,the yard template design problem with periodical vessel calling schedules is studied with potential traffic congestion factor considered.Subsequently,an integer linear programming model is established to.Allocate export containers to each block according to the information of the arrival time and space demand of vessels,such methods significantly reduce the cost of scheduling containers at the terminal.We performed programming experiments using the optimizer Gurobi.The experimental results show that the model can be solved quickly under the condition of different numbers of vessels,and the results are in line with the actual operation requirements.After obtaining the storage assignments in Chapter 2,considering the research object of this thesis is the land-scare terminal,therefore the third chapter is to establish an integer programming model to achieve the purpose of minimizing the occupied space according the storage plan.Because of abundant decision variables and constrains,it is found that the calculation time is too long to accept by using the optimizer Gurobi.Therefore this thesis draws on the idea of the traditional bin packing problem constructive algorithm to design block template heuristic algorithm,and elaborates the design idea,flow and pseudocode of this algorithm.In the end,a programming experiment is performed.The experiment results show that compared with Gurobi,the proposed algorithm can save at least about 87% of the calculation time.Moreover,it can demonstrate the layout of any blocks directly.