| |
| Acadêmico(a): Denise Brandt |
| Título: Distribuição Otimizada de Polígonos em um Plano Bidimensional |
| |
| Abstract: |
| This paper develops a solution to the cutting and packing problem. Problem that occurs in manufacturing industries where mold pieces are cut to produce the final product. An algorithm to fit these molds has a great value due to the economy of raw materials and the reallocation of manpower. This paper presents the hill climbing and tabu search algorithms for generating combinations of these polygons on the available area. It\'s also developed the no-fit polygon algorithm for polygons overlapping and the bottom-left fill algorithm for polygons packing. The polygons are packed in an optimal way and with no overlap. They must have anti-clockwise orientation. |
| |
|
