自动化学报2018，Vol.44Issue(1)：106-115,10.DOI:10.16383/j.aas.2018.c160381
基于多元优化算法的三维装箱问题的研究
Multi-variant Optimization Algorithm for Three Dimensional Container Loading Problem
摘要
Abstract
This paper investigates that three-dimensional container loading problem is solved by the Multi-variant op-timization algorithm. The Multi-variant optimization algorithm applied random placement and partial adjustment to gradually approximate the optimal solution. The random placement denotes that several boxes of randomly selected are put into the container; the partial adjustment indicates that the sequence of the boxes in the container of random placement are topically adjusted and optimized with objective function value. Then, the objective function value will gradually approximate the optimal value by recursively random replacement, partial adjustment and optimization, and we acquire a desirable three-dimensional container loading program. In order to verify the effectiveness and practicability of three-dimensional container problem with the multi-variant optimization algorithm, 1 000 groups of three-dimensional container loading problems that vary from BR1-BR10 are tested in this paper and acquire desirable results.关键词
三维装箱问题/多元优化算法/随机放置/局部调整/逐步逼近Key words
Three-dimensional container loading problem/multi-variant optimization algorithm/random placement/partial adjustment/gradually approximation引用本文复制引用
李孙寸,施心陵,张松海,董易,高莲..基于多元优化算法的三维装箱问题的研究[J].自动化学报,2018,44(1):106-115,10.基金项目
国家自然科学基金(61261007,61561049),云南省自然科学基金(2013FA008)资助Supported by National Natural Science Foundation of China(61261007,61561049)and Natural Science Foundation of Yun-nan Province(2013FA008) （61261007,61561049）
