The Research Of Approaches To Solving Complex Container-loading Problem

Assembling goods in a container is a process that put goods of different kinds, which have certain volume, weight, value and number, in the space of container having certain volume and loading capacity restraint. It must satisfy qualitative and quantitative requirements. In qualitative aspect, the main consideration is rational utilization of the space and improving the safety coefficient in the transportation way, etc; In quantitative aspect, the main consideration is value maximization of cargo of different type and quantity in finite space. This kind of problem is a combinatorial optimization problem of muti-constraint and muti-object, called Complex Container-loading Problem. 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 summarizes the bin packing problem in sorts, and expounds research contents and it's significance. Following, it emphasizes on analyzing the complex three-dimensional container problem of bin packing problem, sums up the current study situation both at home and abroad, and points out the advantages and disadvantages of existing achievements. The differences of several sub problems in constraint conditions and objective functions are reviewed from the point of the change form and sorts of container loading problem, and the existing solutions are studied in the terms of heuristic method and evolutional algorithm.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 loading efficiency and space utilization ratio using heuristic method based on three partitioning space pointing to one goods, a new heuristic method based on six partitioning space is put forward according to the idea that goods of the same type should be loaded at the...