Informações Principais
     Resumo
     Abstract
     Introdução
     Conclusão
     Download
  
  
  
 
Abstract
 
 
Acadêmico(a): Daniel Pamplona Soares
Título: GENETIC PACKING: SOFTWARE PARA EMPACOTAMENTO TRIDIMENSIONAL HETEROGÊNEO EM CONTÊINERES
 
Abstract:
This work presentes the development of a software for solving the Heterogeneous Three- dimensional Bin Packing Problem. As it is a difficult problem in the theory of computational complexity, a genetic algorithm was used to solve the problem. Its main purpose is to allocate a set of heterogeneous bins in a minimum number of containers, considering that each container should have the maximum occupation. To visualize the results of the algorithm a 3D environment for Java was developed using the JOpenGL library, allowing the user to walk through the scenario and observe the result of the generated algorithm. With this visualization, the user can also observe the data regarding algorithm execution, such as, the number of generations to achieve the objective and percentage occupancy of the container. From the results analyzed, it was possible to observe that the genetic algorithm found solutions for the problem and the parameterization of the software is sensitive to the proposed scenario.