• 한국경영과학회지
• /
• 제34권3호
• /
• pp.43-53
• /
• 2009

The pallet loading problem(PLP) requires the best orthogonal layout that loads the maximum number of identical boxes(small rectangle) onto a pallet(large rectangle). Since the high pallet utilization saves the distribution and storage costs, many heuristic and exact algorithms have been developed so far. Martins and Dell have found the optimal layouts for the all PLPs less than or equal to 100 boxes except for only 5 problems in their recent research. This paper defines the 'stair structure' and proposes a new exact algorithm applying it. In order to show the priority of the proposed algorithm, computational results are compared to previous algorithms and the optimal layouts for the S unsolved problems are given.

• 대한기계학회논문집A
• /
• 제31권5호
• /
• pp.609-616
• /
• 2007

Palletizing is necessary to promote the efficiency of storage and shipping tasks. These are, however some of the most monotonous, heavy and laborious tasks in the factory. Therefore many types of robot palletizing systems have been developed, but many robot motion commands still depend on the teaching pendent. That is, an operator inputs the motion command lines one by one. It is very troublesome, and most of all, the user must know how to type the code. That is why we propose a new GUI (Graphic User Interface) Palletizing System. To cope with this issue, we proposed a 'PLP' (Pallet Loading Problem) algorithm, Fast Algorithm and realize 3D auto-patterning visualization interface. Finally, we propose the robot palletizing simulator. Internally, the schematic of this simulator is as follows. First, an user inputs the physical information of object. Second, simulator calculates the optimal pattern for the object and visualizes the result. Finally, the calculated position data of object is passed to the robot simulator. To develop the robot simulator, we use an articulated robot, and analyze the kinematics and dynamics. Especially, All problem including thousands of boxes were completely calculated in less than 1 second and resulted in optimal solutions by the Fast Algorithm.