基于多元优化算法的三维装箱问题的研究

用多元优化算法（Multi-variant optimization algorithm，MOA）实现三维装箱问题的求解.算法通过随机放置和局部调整从而逐步逼近最优解.随机放置是将随机选择的几个箱子装入容器中；局部调整是根据目标函数值对随机放置容器的箱子序列作局部调整优化；通过递推的随机放置和局部调整优化，目标函数值逐步逼近最优值，从而获得一个较为理想的三维装箱方案.算法通过对BR1~BR10共1000组三维装箱问题测试实例的测试仿真，得到理想的装箱效果，说明用多元优化算法实现三维装箱问题的有效性和可行性.

Multi-variant Optimization Algorithm for Three Dimensional Container Loading Problem

This paper investigates that three-dimensional container loading problem is solved by the Multi-variant optimization 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, 1000 groups of three-dimensional container loading problems that vary from BR1-BR10 are tested in this paper and acquire desirable results.