An Improved Heuristic For Single Container Loading Weakly Heterogeneous Cargo Problem

Nature of container loading layout optimization problem is a combination of constraints in complex optimization problems belong to NP-Hard problem, it is difficult to find the optimal solution in a limited time. In recent years, a number of intelligent algorithms, such as ant colony algorithm, genetic algorithms, simulated annealing algorithm, the improved algorithm and intelligent in solving such problems provides an effective way. Although these algorithms to some extent, improve the related performance, but when the question of increase in size and complexity, have shown its own shortcomings. By studying a large number of references, a comprehensive comparative analysis of container loading layout optimization problem solving method, this paper presents an improved heuristic method for solving a single container loading weakly heterogeneous layout optimization problem.In this paper, container loading problem complexity constraints established constraint functions, and containerized maximize space utilization function as the target function mathematical model; container loading design method for solving the problem, and a detailed description of the method steps; describes the container loading process the main concepts involved and the main problems faced. In the solution process, ants considering the current iteration number, and information to be loaded cargo space divided by three methods, to be loaded information space space space division and consolidation strategy was, according to the selected goods selected Cargo probability formula, and selected goods backtracking mode selection display mode for loading, thereby generating value and worth to prune state information according to the state, and finally to make or continue to prune or loading the appropriate action based on this information, all the ants all at once when loading the updated information Su matrix. When the number of iterations to meet the requirements, the output of the approximate optimal solution. Finally, a folding bicycle factory in Tianjin actual data Loh & Nee algorithms six groups of test data to verify the validity of the algorithm.This paper not only in theory to study the container loading problem, but also design and implementation a method for solving container loading problem.last developed a simulation system for the container loading process visual display.