2018-12-272022-04-262022-04-262018-11-27NASCIMENTO, Oliviana Xavier do. Problema de carregamento em um único contêiner: abordagem exata e restrições práticas. 2018. 142 f. Dissertação (Mestrado em Modelagem e Otimização) - Universidade Federal de Goiás, Catalão, 2018.http://repositorio.ufcat.edu.br/tede/handle/tede/9192This work presents an approach to solve the single container loading problem. The goal is to decide which items should be loaded inside the container in order to maximize the packed value. The approach is divided into two steps. The approach integrates integer programming and constraint programming models within an iterative scope. In addition, thirteen practical constraints are considered. These constraints are used to ensure complete shipment of items from the same customer, separation of conflicting items, priority conditions, vertical and horizontal cargo stability, items’ fragility, multi-drop situations, load balancing, that the resulting packing can be separated by cuts that go from one side to the other of the container without items being fragmented during the cutting, manual loading, separation of different customer’s items within the container, grouping of items and that items can be packed in different orientations. Mathematical formulations are developed for each one of them. The formulations are the main contribution of this research since there is a gap in the literature with respect to works that present mathematical formulations to practical constraints in the studied problem. Other contributions are the integration of integer programming and constraint programming models, the presentation of a new relaxation of integer programming to the problem, a new cut, and constraints for the reduction of symmetries. Instances from the literature are solved. The results showed that the largest losses of container’s volume are for the complete shipment constraint, while the smallest losses of container’s volume are for the grouping of items. The largest runtimes happen for the cargo vertical stability. The results also showed that the proposed relaxation, the constraints for symmetries breaking and the cut bring contributions with respect to the computational time and the number of instances solved to optimality.application/pdfAcesso AbertoProblema de carregamento em contêineresRestrições práticasProgramação linear inteiraProgramação por restriçõesMétodo exatoContainer loading problemPractical constraintsInteger linear programmingConstraint ProgrammingExact methodCIENCIAS EXATAS E DA TERRA::MATEMATICADissertação