A Heuristic Algorithm For The Pre-marshalling And Relocation Problems Research

In recent years, with the development of international trade, transport is growingespecially the port container transport demand. The most important problem in ports ishow to improve the utilization of dock and the efficiency of container loading andunloading. To improve the above problems, we must focus on the study of variouscontainer terminals. We put the containers together according to its features because it isconvenient to manage those containers, the operation of the port container contains twoparts: Pre-marshalling and Relocation. We consider the action of pre-marshalling in a bay.Through the pre-marshalling, containers come to the right order by in spare time. Whenthe ship arrives, the loading and unloading become simpler than ever, we can minimize thenumber of turning, let the operation more efficient and effective; it is of great significanceto the research of the port optimization problems.This thesis first consider the pre-marshalling operation, according to thecharacteristics of container, we set up pre-marshalling single-valued attribute minimumturnover number model. And then we put forward a heuristic algorithm for containers tooptimize the box turnover process, numerical examples are given and it shows that theheuristic based on global box process has certain superiority. Lastly we extend theproblem to multiple-valued attributes problem. After the pre-marshalling, minimize theturnover box number model is established which gives3kinds of principle for thisproblem, and then turn over the boxes in the3principles are compared. We can get thefollowing conclusions: presented in this thesis the game box turnover principle putsforward a new kind of box turnover sequence, greatly reduced the turnover number,indirectly improved resource utilization and shipment in container ports and the operationof container terminal gets great improvement.