The Improvement Of A Hybrid Genetic Simulated Annealing Algorithm For Three Dimensional Bin-packing Problems

As an important part of modern logisties, the problems of container assembling goods are prevalent in the cargo transportation process. In order to achieve high utilization of container space, to reduce transportation costs, it is imperative to seek a reasonable packing program, and gets improve its economic efficiency. From the nature point of view, container loading problem is NP (Non deterministie Polynomial)-complete problem. Therefore, to solve practical problems in container loading mathematical problems, it needs to find a reasonable and effective optimization algorithms to solve loading problems. Solving these problems and NP-complete problem has a very important significance.Based on container assembling goods in reality, this paper give a kind of finishing packing, with the space divided multilayer successive optimization scheme. With the constraints such as considering the direction, weight, priority, cargo arrangement position and so on, the purpose of this scheme is to improve space utilization and efficiency of the packing process. In this paper, we intrduced a hybrid algorithm with space partition, space merger, an average height of loading and layered loading strategy. Based on heuristic algorithm and genetic algorithm, it is combined with the limited principle of maximum caving degree principle. From above of all, this paper proposed a multilayer successive optimization strategy, which concluds Combination of preprocessing Optimization, bottom layer space optimization, layer-by-layer space optimization, the final optimization. This scheme is closely to the actual situation of cargo loading operation, which with a variety of constraints, meets the actual packing process and has strong applicability.This paper firstly gives a simple introduction about the status of logistics optimization problem of storage space, and then makes a detailed analysis and comparison about Genetic Algorithm and Simulated Annealing Algorithm. which are pointed out the shortcomings and weaknesses, finally proposes a hybrid aglorithm combined with Genetic Algorithm and Simulated Annealing Algorithm after improved and optimized. This article Proposed the flow diagram of hybrid aglorithm and theory. Combined with practical loading constraints, we bulided a Optimized model of this hybrid aglorithm, which passed Visual C++6.0test. Eventually it proposed multi-step optimization strategies. The first is the process of loading the cargo to be loaded pretreatment optimizing the cargo to be loaded wich are sorted according to a certain order to solve the problem of container assembling storage space. Compared with the previous results, then optimization space of the container, the first is to optimize its bottom and then layer by layer optimization of space. So it is usrful for three Dimensional Bin-packing. So you can refer to the solutions to the problem of having the same type.