目的 以相同规格包装箱为研究对象，求解包装箱组托码放规则的最优化方案。方法 以H2DPP模型为基础，采用块启发式算法，建立非线性规划模型，利用Lingo软件求解最优码放数量及各决策变量值。结果 在托盘规格一定的情况下，包装箱规格越大，目标函数值越小；托盘长宽与包装箱长宽分别成整数比时，迭代的次数要远小于其他情况。结论 利用Lingo软件求解非线性规划组托模型，用时不超过0.05 s，该方案更高效、准确地解决了流通过程中包装箱的组托问题，实现了组托方法的最优化。

With the same specifications of packing box as the research object, the work aims to solve the optimization scheme for packing group support stacking rules. Based on H2DPP model, a nonlinear programming model was built by heuristic algorithm. The optimal number of pieces and each decision variable values were solved by Lingo software. In the case of a certain size of the tray, the larger the size of the packing box, the smaller the value of the objective function. The number of iterations was much smaller than the others when the length and width of the pallet and the length and width of the packing box both formed a ratio of integers. The nonlinear programming model is solved by Lingo software. With use time no more than 0.05 s, this scheme more efficiently and accurately solves problems with group support of packing box in circulation process and realizes the optimization of the group support method.