Some Problems And Algorithms Of Complex System Of Intelligent Container Terminal

The first chapter introduces something about developments of container terminal and its work procedure first. Secondly, we analyze some problems which exist in the work procedure of container terminal and provide a scheme based on graph theory. At last, some foundational knowledges of graph theory could be introduced.The second chapter is the most important one in this thesis and includes the main innovation. There are five sections in this chapter. The first section introduces foundational theory of perfect matching, maximum matching and algorithm for finding maximum matching. In the second section, we find the problems which exist in stowing procedure, then we abstract a bipartite graph model from the stowing procedure and define the concept of generalization matching. At last, the process of how to find the generalization matching on the bipartite graph is given. In the third section, we think of the problems of matching and network flows, and provide two efficient algorithms based on matching theory and network flows respectively. The proofs are given at last. In the fourth section, we discuss the generalization matching on bipartite weighted graphs and the algorithm for finding a generalization matching with the maximum weight. In the fifth section, we apply our new theory to the auto-stowing software system in container terminal.In the third chapter, we discuss and study two practical shipment methods, then we establish a mathematical matrix model, find a reasonable algorithm and show the feasibility in operation.The last chapter discusses the modeling for turning out problem of containers on the aspects of graph theory, and gives a restricted breadth-first search algorithm. This algorithm gives us the minimum number of steps which can lead us to an optimum condition.