装盘规划问题的G4算法求解实现

The G4-Heuristic for the Pallet Loading Problem and Its Computer Implementation

在企业生产过程中,一个托盘上小型物品数目的增多往往意味着运输次数的减少,从而可以降低运输成本。而G4算法至今保存了解决此方面问题的先进性。G4算法的实现具有一定难度,包括对G4算法的理解、对复杂动态规划方法的理解、需要对程序运行时间和空间进行优化等,本文数值模拟的图形输出与国外应用程序有很好的一致性。

In the process of production in a plant, an increase in the number of items on a pallet leads directly to a decrease in transportation times, which is the reason that the transportation cost can be lowered. The implementing of the G4-heuristie has considerable difficulties, it includes comprehending of the G4-heuristic, understanding the approach for the dynamic programming, the requirements to optimize of the program＇s running time and the program＇s running space. This paper has implemented the algorithm that the output graphics of the computation result has a good consistency with the foreign application program.