Source: http://www.proceedings.blucher.com.br/article-details/modelo-de-programao-linear-inteira-para-o-problema-de-carregamento-de-mltiplos-contineres-com-restries-de-carregamento-completo-de-grupo-de-itens-e-de-estabilidade-vertical-11923
Timestamp: 2019-04-23 08:53:36+00:00

Document:
Este trabalho trata um caso particular dos problemas de corte e empacotamento, conhecido como Problema de Carregamento de Contêiner. O objetivo de estudo deste trabalho é apresentar um modelo de programação linear inteira capaz de assegurar o carregamento completo de grupo de itens e a estabilidade vertical da carga num conjunto limitado de contêineres. Embora comuns no cotidiano, algumas dessas considerações práticas raramente são tratadas em trabalhos correlatos. Testes computacionais com instâncias adaptadas da literatura foram realizados para validar o modelo proposto. Os resultados mostram que a abordagem é coerente e descreve adequadamente as situações abordadas.
This work deals with a particular case of the cutting and packing problems, known as Container Loading Problem. This paper aims to present a integer linear programming model that ensures the complete shipment of a group of items and the vertical stability of the load in a limited set of containers. Although common in daily situations, some of these practical considerations are seldom addressed in related works. Computational tests on instances adapted from the literature were performed to validate the proposed model. The results show that the approach is consistent and appropriately describes the situations addressed.
 ALMEIDA, A.; FIGUEIREDO, M. B. 2010. A particular approach for the three-dimensional packing problem with additional constraints. Computers Andamp; Operations Research, v. 37, n. 11, p. 1968–1976.
 BISCHOFF, E. E.; RATCLIFF, M. S. W. 1995. Issues in the development of approaches to container loading. Omega, v. 23, n. 4, p. 377–390.
 BORTFELDT, A.; WÄSCHER, G. 201 Constraints in container loading – A state-of-the-art review. European Journal of Operational Research, v. 229, n. 1, p. 1–20.
 CHEN, C.S.; LEE, S. M.; SHEN, Q.S. 1995.An analytical model for the container loading problem. European Journal of Operational Research, v. 80, n. 1, p. 68–76.
 ELEY, M. 2002. Solving container loading problems by block arrangement. European Journal of Operational Research, v. 141, n. 2, 393–409.
 ELEY, M. 2003. A bottleneck assignment approach to the multiple container loading problem. OR Spectrum, v. 25, n. 1, p. 45–60.
 JUNQUEIRA, L.; MORABITO, R.; YAMASHITA, D. S. 2012. Three-dimensional container loading models with cargo stability and load bearing constraints. Computer Andamp; Operations Research, v. 39, n. 1, p. 74–85.
 MOHANTY, B. B.; MATHUR, K.; IVANCIC, N. J. 1994. Value considerations in three-dimensional packing – A heuristic procedure using the fractional knapsack problem. European Journal of Operational Research, v. 74, n. 1, p. 143–151.
 MOURA, A., OLIVEIRA, J.F. 200 An integrated approach to the vehicle routing and container loading problems. OR Spectrum, v. 31, n. 4, p. 775–800.
 PADBERG, M. 2000. Packing small boxes into a big box. Mathematical Methods of Operations Research, v. 52, n. 1, p. 1–21.
 REN, J.; TIAN, Y.; SAWARAGI, T. 20 A tree search method for the container loading problem with shipment priority. European Journal of Operational Research, v. 214, n. 3, p. 526–535.
 TSAI, R.D.; MALSTROM, E. L.; KUO, W. 1993. Three dimensional palletization of mixed box sizes. IIE Transactions, v. 25, n. 4, p. 64–75.
 WÄSCHER, G., HAUβNER, H., SCHUMANN, H. 2007. An improved typology of cutting and packing problems. European Journal of Operational Research, v. 183, n. 3, p. 1109–1130.
Schenekemberg, Cleder Marcos; Kurpel, Deidson Vitorio; Scarpin, Cassius Tadeu; "MODELO DE PROGRAMAÇÃO LINEAR INTEIRA PARA O PROBLEMA DE CARREGAMENTO DE MÚLTIPLOS CONTÊINERES COM RESTRIÇÕES DE CARREGAMENTO COMPLETO DE GRUPO DE ITENS E DE ESTABILIDADE VERTICAL", p. 393-401 . In: Anais do Congresso Nacional de Matemática Aplicada à Indústria [= Blucher Mathematical Proceedings, v.1, n.1]. São Paulo: Blucher, 2015.
ALMEIDA, A.; FIGUEIREDO, M. B. 2010. A particular approach for the three-dimensional packing problem with additional constraints. Computers Andamp; Operations Research, v. 37, n. 11, p. 1968–1976. BISCHOFF, E. E.; RATCLIFF, M. S. W. 1995. Issues in the development of approaches to container loading. Omega, v. 23, n. 4, p. 377–390. BORTFELDT, A.; WÄSCHER, G. 2013. Constraints in container loading – A state-of-the-art review. European Journal of Operational Research, v. 229, n. 1, p. 1–20. CHEN, C.S.; LEE, S. M.; SHEN, Q.S. 1995.An analytical model for the container loading problem. European Journal of Operational Research, v. 80, n. 1, p. 68–76. ELEY, M. 2002. Solving container loading problems by block arrangement. European Journal of Operational Research, v. 141, n. 2, 393–409. ELEY, M. 2003. A bottleneck assignment approach to the multiple container loading problem. OR Spectrum, v. 25, n. 1, p. 45–60. JUNQUEIRA, L.; MORABITO, R.; YAMASHITA, D. S. 2012. Three-dimensional container loading models with cargo stability and load bearing constraints. Computer Andamp; Operations Research, v. 39, n. 1, p. 74–85. MOHANTY, B. B.; MATHUR, K.; IVANCIC, N. J. 1994. Value considerations in three-dimensional packing – A heuristic procedure using the fractional knapsack problem. European Journal of Operational Research, v. 74, n. 1, p. 143–151. MOURA, A., OLIVEIRA, J.F. 2009. An integrated approach to the vehicle routing and container loading problems. OR Spectrum, v. 31, n. 4, p. 775–800. PADBERG, M. 2000. Packing small boxes into a big box. Mathematical Methods of Operations Research, v. 52, n. 1, p. 1–21. REN, J.; TIAN, Y.; SAWARAGI, T. 2011. A tree search method for the container loading problem with shipment priority. European Journal of Operational Research, v. 214, n. 3, p. 526–535. TSAI, R.D.; MALSTROM, E. L.; KUO, W. 1993. Three dimensional palletization of mixed box sizes. IIE Transactions, v. 25, n. 4, p. 64–75. WÄSCHER, G., HAUβNER, H., SCHUMANN, H. 2007. An improved typology of cutting and packing problems. European Journal of Operational Research, v. 183, n. 3, p. 1109–1130.

References: v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v.