计算机工程与应用2019，Vol.55Issue(14)：32-39,47,9.DOI:10.3778/j.issn.1002-8331.1902-0127
求解三维装箱问题的混合遗传模拟退火算法
Study on Hybrid Genetic and Simulated Annealing Algorithm for Three-Dimensional Packing Problems
摘要
Abstract
The container loading is an important step in the process of cargoes transportation. It belongs to the NP-hard problem. In order to improve the efficiency and reduce the cost, it proposes that the three-dimensional loading model should be established with the maximization of the volume utilization rate. At the same time, the conditions of the volume constraints, the weight constraints, the center of gravity constraints and the directional constraints are considered. The hybrid genetic algorithm, simulated annealing algorithm and three-space division heuristic algorithm are used to solve the model. The local optimal preservation strategy is incorporated into the algorithm to avoid fitness reduction in subsequent algo-rithm. Through the performance test of the strongly heterogeneous and weakly heterogeneous examples, the 3D load map and the objective function value are obtained by combining with the specific data of cargo loading. The results show that the algorithm in this paper has good effect on container loading.关键词
三维装箱问题/启发式算法/遗传算法/模拟退火算法Key words
three-dimensional container loading problem/heuristic algorithm/genetic algorithm/simulated annealing algorithm分类
信息技术与安全科学引用本文复制引用
张钧,贺可太..求解三维装箱问题的混合遗传模拟退火算法[J].计算机工程与应用,2019,55(14):32-39,47,9.基金项目
国家自然科学基金(No.71601009). （No.71601009）
