讨论了集装箱堆场中一个常见的问题 ,即若干个不同重量的集装箱按一定顺序到达 ,要将这些箱子三个一垛码好 ,先到先码 ,后到后码 ,尽量轻箱在下 ,重箱在上 ,以保证装船时重箱在下 ,轻箱在上。因为在大多数情况下 ,无论怎样码放 ,都免不了捣箱。因此 ,如何码放才能使捣箱数最小是值得研究的问题 ,此问题可能是N P难的问题 ,所以本文给出了这一问题的一个启发式算法 A common problem in container yard is discussed, that is, a number of containers of different weights arrive in a certain order. The three stacks of the boxes should be good, first code, last code, light box, light box On, in order to ensure that heavy boxes in the next ship, light boxes on the. Because in most cases, no matter how the code, will inevitably pound box. Therefore, how to minimize the number of pallets is a problem that needs to be studied. This problem may be a difficult problem, so this paper presents a heuristic algorithm for this problem