dc.contributor | Alvarez Martínez, David | |
dc.contributor | Megalia Gonzalez, Andrés | |
dc.contributor | Escobar Falcón, Luis Miguel | |
dc.creator | Amézquita Ortiz, Santiago | |
dc.creator | Romero Olarte, Natalia | |
dc.date.accessioned | 2022-12-05T13:54:49Z | |
dc.date.accessioned | 2023-09-06T23:09:09Z | |
dc.date.available | 2022-12-05T13:54:49Z | |
dc.date.available | 2023-09-06T23:09:09Z | |
dc.date.created | 2022-12-05T13:54:49Z | |
dc.date.issued | 2022-12-02 | |
dc.identifier | http://hdl.handle.net/1992/63361 | |
dc.identifier | instname:Universidad de los Andes | |
dc.identifier | reponame:Repositorio Institucional Séneca | |
dc.identifier | repourl:https://repositorio.uniandes.edu.co/ | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8726246 | |
dc.description.abstract | El problema de carga de contenedores tiene un amplio espectro de aplicación en la industria y ha sido estudiado en academia por más de 60 años debido a su alta complejidad matemática y computacional.En este trabajose estudia el problema de carga de un único contenedor (CLP del inglés, Container Loading Problem)considerando restricciones prácticas de la industria. En este trabajo se consideran las restricciones de orientación, límites de pesos máximos deapilamiento y estabilidad estática de las cajas, límites de pesos máximos de cargue del contenedor, y carga fraccionada en diferentes destinos.Para resolver este problema se propone un sistema de apoyo a la decisión(DSS)de código abierto embebido dentro de un software comercial de gran aceptación (Excel ®). El DSS desarrollado incorpora un algoritmo heurístico que permite encontrar soluciones eficientes parael CLP con restricciones prácticas de la industria. La heurística propuesta utiliza la representación de espacios residuales máximosy consiste en un algoritmo constructivo aleatorizado de multi-arranque. El algoritmo constructivo intenta crear el patrón de carga a través de la elaboración de capas verticales de cajas(columnas y paredes),seleccionándolas aleatoriamentede una lista ordenada y restricta de las capas con mejorencaje (o mayor volumen).El desempeño del algoritmo propuesto fue validado a través de un estudio computacional extenso, utilizando las instancias clásicas de la literatura especializada y comparando los resultados obtenidos versus los mejores trabajos previos publicados en una especie de benchmarking. Además, se analizó el impacto de la restricción de carga fraccionada en diferentes destinossobre los indicadores de ocupación.El DSS presentado permite crear o cargar instancias de cubicaje, visualizar los patrones paso a paso y mostrar las estadísticas a través de interacciones sencillas pensadas en el usuario. Como trabajo futuro, se espera considerar las restricciones de balance de carga y estabilidad dinámica. | |
dc.description.abstract | The container loading problem has a broad spectrum of applications in the industry. It has been studied in academia for more than 60 years due to its high mathematical and computational complexity. This paper studies the Container Loading Problem (CLP) considering practical industry constraints. This work considers orientation constraints, maximum stacking weight limits and static stability of the boxes, maximum container loading weight limits, and fractional loading at different destinations (multi-drop). An open-source decision support system (DSS) embedded within a widely accepted commercial software (Excel ®) is proposed to solve this problem. The DSS uses a heuristic algorithm to find efficient solutions for CLP with practical industry constraints. The proposed heuristic uses the maximum residual space representation and consists of a multi-start randomized constructive algorithm. The constructive algorithm attempts to create the loading pattern by elaborating vertical layers of boxes (columns and walls) by randomly selecting them from an ordered and constrained list of the best-fit (or largest volume) layers. The performance of the proposed algorithm was validated through an extensive computational study, using the classical instances of the specialized literature, and carrying out a benchmark comparison of the results obtained against the best previous works. In addition, the impact of multi-drop constraint on utilization indicators was analyzed. The presented DSS allows creating or loading cubing instances, visualizing the patterns step by step, and displaying statistics through simple user-focused interactions. Future work is expected to consider load balancing and dynamic stability constraints. | |
dc.language | spa | |
dc.publisher | Universidad de los Andes | |
dc.publisher | Maestría en Ingeniería Industrial | |
dc.publisher | Facultad de Ingeniería | |
dc.publisher | Departamento de Ingeniería Industrial | |
dc.relation | Ali, S., Ramos, A.G., Carravilla, M. A. yOliveira, J,F. (2022). On-line three-dimensional packing problems: A review of off-line and on-line solution approaches. Computers & Industrial Engineering, 168. | |
dc.relation | Araya, I., & Riff, M.-C. (2014). A beam search approach to the container loading problem. Computers & Operations Research, 43, 100-107. doi:10.1016/j.cor.2013.09.00 | |
dc.relation | Bischoff, E. E., Janetz, F., & Ratcliff, M. S. W. (1995). Loading pallets with non-identical items. European Journal of Operational Research, 84(3), 681-692. doi:10.1016/0377-2217(95)00031-k | |
dc.relation | Bischoff, E.E. y Ratcliff, M. S. W. (1995). Issues in the development of approaches to container loading. Omega, 23(4), 377 -390. doi:10.1016/0305-0483(95)00015-G | |
dc.relation | Bonet, G., Trivella, A. & Corman, F. (2022) Modeling Soft Unloading Constraints in the Multi-Drop Container Loading Problem. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2022.10.033 | |
dc.relation | Bortfeldt, A. y Wäscher, G. (2013). Constraints in container loading -A state-of-the-art review. European Journal of Operational Research, 229(1), 1-20. doi:10.1016/j.ejor.2012.12.006 | |
dc.relation | Cardona, C. (2019). Heurística para solucionar el problema de la carga de mercancía en un único contenedor (Tesis de pregrado no publicada).Universidad de los Andes, Bogotá | |
dc.relation | Ceschia S. y Schaerf A. (2013). Local search for a multi-drop multi-container loading problem. Journal of Heuristics, 19: 275-294. doi: 10.1007/s10732-011-9162-6 | |
dc.relation | Chen, C. S., Lee, S. M., & Shen, Q. S. (1995). An analytical model for the container loading problem. European Journal of Operational Research, 80(1), 68-76. doi:10.1016/0377-2217(94)00002-t | |
dc.relation | Christensen S. G. y Rousøe, D. M. (2009). Container loading with multi-drop constraints. International Transactions In Operational Research, 16, 727-743, doi:10.1111/j.1475-3995.2009.00714.x | |
dc.relation | Davies, A. P. y Bischoff, E. E. (1999). Weight distribution considerations in container loading. European Journal of Operational Research, 114(3), 509-527. doi:10.1016/s0377-2217(98)00139-8 | |
dc.relation | De Queiroz, T. A., & Miyazawa, F. K. (2013). Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. International Journal of Production Economics, 145(2), 511-530. | |
dc.relation | Do Nascimento, O. X., de Queiroz, T. A., & Junqueira, L. (2020). Practical Constraints in the Container LoadingProblem: Comprehensive Formulations and Exact Algorithm. Computers & Operations Research, 105186. | |
dc.relation | Fasano, G. (2004). A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2(2). | |
dc.relation | Ferreira, K. M., de Queiroz, T. A., & Toledo, F. M. B. (2021). An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Computers & Operations Research, 136, 105452. doi:10.1016/j.cor.2021.105452 | |
dc.relation | Fuellerer, G., Doerner, K. F., Hartl, R. F., & Iori, M. (2010). Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research, 201(3), 751-759. doi:10.1016/j.ejor.2009.03.046 | |
dc.relation | Gajda, M., Trivella, A., Mansini, R. and Pisinger. D.(2022) An optimization approach for a complex real-life container loading problem. Omega,107(102559) doi: 10.1016/j.omega.2021.102559. | |
dc.relation | Gendreau, M., Iori, M., Laporte, G., & Martello, S. (2006). A Tabu Search Algorithm for a Routing and Container Loading Problem. Transportation Science, 40(3), 342-350. doi:10.1287/trsc.1050.0145 | |
dc.relation | Hokama, P., Miyazawa, F. K., & Xavier, E. C. (2016). A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert Systems with Applications, 47, 1-13. doi:10.1016/j.eswa.2015.10.013 | |
dc.relation | Iori, M., & Martello, S. (2010). Routing problems with loading constraints. TOP, 18(1), 4-27. | |
dc.relation | Iori, M., Salazar-González, J.-J., & Vigo, D. (2007). An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints. Transportation Science, 41(2), 253-264. doi:10.1287/trsc.1060.0165 | |
dc.relation | Iori, M., Locatelli, M,. Moreira, C. & Silveira, T. (2020). Reactive GRASP-based algorithm for palletbuilding problem with visibility and contiguity constraints. In International Conference on Computational Logisstics, pages 651-665. doi:10.1007/978-3-030-59747-4 42. | |
dc.relation | Junqueira, L., Morabito, R. & Sato Yamashita, D. (2012). MIP-based approaches forthe container loading problem with multi-drop constraints. Annals of Operations Research, 199(1), 51-75. | |
dc.relation | Lim, A., Ma, H., Xu, J., & Zhang, X. (2012). An iterated construction approach with dynamic prioritization for solving the container loading problems. Expert Systems with Applications,39(4), 4292-4305. | |
dc.relation | Liu, WY., Lin CC. & Yu, CS. (2011). On the three-dimensional container packing problem under home delivery service. Asia-Pacific Journal of Operational Research, 25(5), 601-621. | |
dc.relation | Martello, S., Pisinger, D., & Vigo, D. (2000). The Three-Dimensional Bin Packing Problem. Operations Research, 48(2), 256-267. doi:10.1287/opre.48.2.256.12386 | |
dc.relation | Martínez, D. A., Alvarez-Valdes, R., & Parreño, F. (2015). A grasp algorithm for the container loading problem with multi-drop constraints. Pesquisa Operacional, 35(1), 1-24. doi:10.1590/0101-7438.2015.035.01.0001 | |
dc.relation | Mecón, J. D. (2020) Estudio del problema logístico de carga paletizada en camiones (Tesis de pregrado no publicada). Universidad de los Andes, Colombia. | |
dc.relation | Pan, L., Chu, S. C. K., Han, G., & Huang, J. Z. (2009). A tree-based wall-building algorithm for solving container loading problem with multi-drop constraints. 2009 IEEE International Conference on Industrial Engineering and Engineering Management. doi:10.1109/ieem.2009.5373282 | |
dc.relation | Parreño, F., Alvarez-Valdes, R., Tamarit, J. & Oliveira, J.F. (2008). A Maximal-Space Algorithm for the Container Loading Problem. INFORMS Journal on Computing,20(3), 412-422, doi: 10.1287/ijoc.1070.0254 | |
dc.relation | Paquay, C., Schyns, M., & Limbourg, S. (2014). A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. International Transactions in OperationalResearch, 23(1-2), 187-213. doi:10.1111/itor.12111 | |
dc.relation | Pitney Bowes. (2022) Parcel Shipping Index. Pitney Bowes. https://www.pitneybowes.com/us/shipping-index.html | |
dc.relation | Pollaris, H., Braekers, K., Caris, A., Janssens, G. K., & Limbourg, S. (2014). Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. EURO Journal on Transportation and Logistics, 5(2), 231-255. doi:10.1007/s13676-014-0064-2 | |
dc.relation | Ratcliff, M. S. W. & Bischoff, E. E. (1998). Allowing for weight considerations in container loading. OR Spektrum, 20 (1), 65-71. doi:10.1007/bf01545534 | |
dc.relation | Romero, N. (2020). Restricciones de fuerza de carga máxima en el problema de carga en único contenedor(Tesis de pregrado no publicada). Universidad de los Andes, Colombia. | |
dc.relation | Silva, E. F., Toffolo, T. A. M. &Wauters, T. (2019). Exact methods for three-dimensional cutting and packing: a comparative study concern | |
dc.relation | Téllez, J. (2019). Dos enfoques heurísticos para el problema de carga de contenedores precisando condiciones de balance de carga (Tesis de pregrado no publicada). Universidad de los Andes, Colombia. | |
dc.relation | Toffolo, T. A. M., Esprit, E., Wauters, T., & Vanden Berghe, G. (2017). A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. European Journal of Operational Research, 257(2), 526-538. doi:10.1016/j.ejor.2016.07.033 | |
dc.relation | Wäscher, G., HauBner, H. & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109-1130, doi: 10.1016/j.ejor.2005.12.047 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | |
dc.rights | https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.rights | http://purl.org/coar/access_right/c_abf2 | |
dc.title | Sistema de apoyo a la decisión para resolver el problema de carga de un único contenedor considerando restricciones prácticas | |
dc.type | Trabajo de grado - Maestría | |