Optimization Study On Berth Allocation Problem In Coal Terminal With Yard Space Constraints

With the development of the economy, the coal terminals are faced with huge need of throughput, which adds the pressure on the berth and yard resource. In order to meet the challenge, the coal terminal like to improve the productiveness of the berth and yard rather than rebuild the berth and yard facilities, because rebuilding the berth and yard facilities would cost a lot and last for a long time. So more and more research have paid much attention to the operation efficiency of the berth and yard.In this research. we analyse a lot of relative researches at home and abroad. It's find that from the respect of object, most of the research about berth allocation problem study on the container terminal.The bulk terminal especially the coal terminal receive few attention. From the respect of study content, simultaneous berth allocation and other resource planning become a trend. From the respect of the influence of yard planning on berth allocation, the most consider the impact of yard planning on the logistics distance between the berth and the block, or the constraints of the rules in yard on the berth allocation.With the analysis on the relative research and the different operation between coal terminal and container terminal, we set up a optimization model with yard space constraints. In the model, dynamic arrival time of the vessel, berthing rules of discrete berth layout, unloading process of the coal terminal and yard rules are considered. More importantly, we highlight the constraint of the dynamic yard space on the berth allocation, and propose a mixed integer programming with the objective of minimization of vessels' total service time in coal terminal.To solve the problem we develop the branch and bound method and use the IBM CPLEX optimization software to conduct a large amount of computational experiments which show that the proposed model improves the current berth management strategy.