The Research Of Approaches To Solving There-dimension Container Packing Problem Of Web Mode

The scheme of the container assembling goods is a process that put different kinds and quantity of goods, which have certain volume, weight, value and number, in the space of container having certain volume and loading capacity restraint. Container packing problem exists in industry areas widely, especially in logistics area. With the development of the market economics in China, the logistics related activities become more and more important, As a key technology, container packing problem is very important on improving the efficiency of distributing works, optimizing the cargos loading pattern and standardizing the business process. Many packing questions seemingly simple are often NP-complete problem, namely, we can't find the optimized solution within limited time.This dissertation first points out the era background that the subject produces, then analyses the current study situation of container packing problem, and expounds research contents and it's significance. Following emphasizes on analyzing the actual demands of three-dimensional container problem, points out container packing in web mode is developing to solve actual problem, then analyses the common algorithms for three dimension bin packing problem,the existing solutions are studied in the terms of heuristic method and evolutional algorithm, pionts out their advantage and disadvangtage for container packing in web mode.On this basis, directing against the fact that, the number of a single type of goods is always more than one or sometimes large and there is low space utilization ratio using existing heuristic method and slow-footed of container packing in web mode using genetic algorithm, from on improving searching algorithm, we introduce immune clonal selection algorithm (ICSA), using clonal amplify,clonal selection to complete stocks evolution, and combining six space heuristic algorithm to improve CSA, making the two complement each other and benefit each other, and put forward hybrid clonal selection algorithm to solve there dimension container loading of web mode.immune clonal selection algorithm is an intelligent algorithm that simulates natural immune system, it's characteristic including memory and characteristic itself is showen in the soluting process. It is the fact that the immune clonal selection algorithm gets the success in picture dispose, assemble optimize, control and exception diagnoses and so on, we combines it and six space heuristic method into hybrid clonal selection algorithm, in order to get global optimal solution. Through analyzing the actual packing data and comparing with existing results from heuristic method and hybrid genetic algorithm, it is indicated that it's effective using the algorithm put forward in the dissertation to deal with complex container loading problem, and loading efficiency and space utilization ratio is high.On the basis of the hybrid clone selection algorithm put forward it this dissertation, a electronic loading system is developed. This software can satisfy muti-constraint qualifications, and is flexible in usage and convenient to install. It can be used by logistics enterprises in practice of loading.At last, the research results are summarized, the successful and deficient place of the hybrid clone selection algorithm based on six partitioning space and electronic loading system is analyzed, and prospects to the further research in this field and some research direction in the future is pointed out.