Three Dimensional Cutting And Packing Problem
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. Algoritmos para problemas de corte e empacotamento / Algorithms for cutting and packing problems
Several versions of Cutting and Packing problems are considered NP-hard and, if we consider that P ¿ NP, we do not have any exact polynomial algorithm for solve them. Practical applications arises for such problems and include: resources allocation for computers; cut of steel, wood, glass, aluminum, etc.; packing of objects; and, loading objects into contai
Publicado em: 2010
-
2. Three-dimensional cutting and packing problems and integration with vehicle routing / Problemas de corte e empacotamento tridimensional e integração com roteamento de veiculos
The wide-scale adoption of the containers made the development of the multimodal transport possible. Nowadays, shipment of boxes in containers is an important activity for companies that have in the load transport a logistic factor of high cost. This work presents the development and the application of metaheuristics with adaptive memory in order to solve th
Publicado em: 2006