| In modern transport, Container is a kind of indispensable means of transport. Some research Points out that the rate of container using is only 75%-82%. As a result of high expenses of transportation, it is very important to do some research on optimization in loading a container. It is good for users to increase economic benefits in transports and for worker to make use of space of a container to make transport plan, to estimate expenses and to design sizes of packing cases. The thesis conducts theory and experimental study in depth focusing on this subject. The main content includes: In assembling analysis, three-line-one-row matrixes are obtained by getting the length, width and height of packing cases. Any given packing cases are assembled by using pedigree assembling analysis, thus, we can obtain the number of the sorts and the length, width and height of each sort; In loading a container, the input is any four kinds of them that are just sorted. The chanced packing cases are loaded by using tier up tier principle, side method and recursive method so that we can obtain higher space occupation; In diagrammatic representation, the result of loading a container is shown in the screen by using simple one-dimension and tow-dimension diagrams. The main work and the core fruits may be summarized as follows:1. Compared with the average space occupation, This method can often bring the rate up to 95%, It is successful to put any four packing cases into any container.2. Any given packing cases are sorted based on pedigree assembling analysis.3. The optimization algorithm of loading a container makes use of tier upon tier principle, side method and recursive method.4. The result of loading a container is shown in the screen using the functions of Top and Left of VB higher-level language.The study and realization of the algorithm play an active and progressive role in the research of putting any four packing cases into any container.
|
PDF Full Text Request