Optimization On The Container Loading Sequences Based On Hybrid Dynamic Programming

With the development of economic globalization and the trend of trade freedom, China is on the way to the spring tide of world economy step by step and its international trade grows quickly. Large-scale logistics comes along large-scale trade; port is the hinge node of the international logistics net, and container transportation is one of the most important modes of modern ship. Therefore, it is an important part of our country’s Logistics Infrastructure construction to build modern container terminals.Shipping is an important link in Container Terminal management. It is mainly to solve that how to determine container location, become container loading sequence and improve the efficiency of transport ships, when loading and discharging containers in different ports, following shipping principles and undertaking stability and strength. Loading Problem is actually a complex combination and optimization problems, simplified to be question of sequence position, that is, loading sequence of containership problems.Port container yard, as an important part of the process of container transportation, is required to be automated, unmanned speedy and as the trend of economization, simplification and standardization in container transportation. Therefore, it is necessary to improve the operation efficiency of container yard. This paper focuses on two main operations of the gate side of container yards:pick-up operation and storage space allocation operation on the gate side of container yards, whose scheduling efficiency has direct impact on the efficiency of truck’s passing through the gate.Based on the industry practices and on the analysis of the actual conditions of the container yard operations, the container loading sequences problem has been formulated a mathematic programming with the consideration of the shipping realistic constraint. Considering the combinatorial explosion growth of the states number, heuristic rules have been added into dynamic programming, on the basis of which a two-phase hybrid dynamic optimization algorithm has been developed. Both the small-sized and large scale of numerical experiments showed the effectiveness and practicability of the model and the algorithm by means of the comparison with the loading plan from actual scheduling rules.