Métodos de optimización aplicados al problema de apilamiento de contenedores

Autores/as

  • Laidy De Armas Jacomino Facultad de Ciencias Informáticas, Universidad de Ciego de Ávila Máximo Gómez Baéz, Ciego de Ávila, Cuba
  • Rafael Bello Pérez Centro de Estudios de Informática, Universidad Central ”Marta Abreu” de Las Villas, Cuba
  • Carlos Morell Pérez Centro de Estudios de Informática, Universidad Central ”Marta Abreu” de Las Villas, Cuba

Palabras clave:

Apilamiento de contenedores, Métodos de optimización, Métodos exactos, Metaheuristícas

Resumen

En las terminales de contenedores marítimas se toman a diario múltiples decisiones tales como la planificación de la estiba en los buques, la asignación de atraques y grúas, el apilamiento de contenedores en la explanada o patio, etc. El apilamiento de contenedores es considerado por varios autores como una de las decisiones más importantes que puede afectar el desarrollo eficiente del resto de las actividades y procesos. Este proceso en una terminal marítima da lugar a la ocurrencia de distintos problemas de optimización conocidos como carga, descarga y recolocación o premarshalling de contenedores. Estos problemas de optimización han sido resueltos por varios autores usando diversos métodos matemáticos conocidos también como métodos exactos, entre ellos están la programación lineal, programación lineal entera, programación dinámica, etc. Además para su solución se han usado métodos computacionales de Inteligencia Artificial como programación de restricciones, metaheurísticas y t écnicas de planificación. La presente revisión bibliogr áfica precisamente hace énfasis en el análisis de los métodos de optimización empleados para resolver estos problemas. Atendiendo a esto los trabajos analizados se agruparon según el método matemático o computacional empleado por los autores estudiados.

Descargas

Los datos de descargas todavía no están disponibles.

Citas

Multi-Objetive Optimization. In Edmund K. Burke and Graham Kendall, editors, Search methodologies. Introductory tutorial in optimization and Decision Support Techniques, pages 274–316. Springer, 2005. 1.1

Galuzca Adam and Daniec Krysztof. Optimization of Re-handling and Load/Unload Operations in Small Container Terminal Operated by Reachstackers. Latest Trends on Systems, 2:616–621, 2010. 2.2

Pedro Félix Alvarez Rivero. Programación Dinámica. ENPES, 1991. 1.2

Imen Ayachi, Ryan Kammarti, M. Ksouri, and Pierre Borne. A Genetic algorithm to solve the container storage space allocation problem. pages 1–4, 2010. 2.1

Mohammad Bazzazi, Nikbakhsh Javadian, and Nima Safaei. A genetic algorithm to solve the storage space allocation problem in a container terminal. Computers & Industrial Engineering, 56:44–52, 2009. 2.1

Rafael Esteban Bello Perez, Zoila Zenaida Garcia Valdivia, Maria Matilde Garcia Lorenzo, and Antonio Reynoso Lobato. Aplicaciones de la Inteligencia Artificial. México, second edition, 2002. 2.2

Edmund K. Burke and Graham Kendall. Search methodologies. Introductory tutorial in optimization and Decision Support Techniques. Springer, 2005. 1, 1.2

Marco Caserta, Silvia Schwarze, and Stefan Voss. Container Rehandling at Maritime Container Terminals. In J. W. B¨ose, editor, Handbook of Terminal Planning, pages 247–269. Springer Science+Business Media, 2011. (document)

Marco Caserta and Stefan Voss. A Corridor Method-Based Algorithm for the Pre-marshalling Problem. In Giacobini, editor, Workshops on Applications of Evolutionary Computation, pages 788–797. Springer Berlin Heidelberg, 2009. 2.1

Marco Caserta, Stefan Voss, and Moche Sniedovich. Applying the corridor method to a blocks relocation problem. OR Spectrum, 33(4):915–929, 2011. 2, 2.1

Chuanyu Chen, Wen-Jing Hsu, and Shell-Ying Huang. Simulation and Optimization of Container Yard Operations: A survey. In Proc. of the International Conference on Port and Maritime R and D and Technology, pages

–29, 2003. (document)

Lu Chen and Zhiqiang Lu. The storage location assignment problem for outbound containers in a maritime terminal. International Journal of Production Economics, 135(1):73–80, 2012. (document), 1.1

Marco Dorigo, Gianni Di Caro, and Luca M. Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life, 5(3):137–172, 1999. 2

Christopher Expósito Izquierdo, Belén Melián Batista, and J. Marcos Moreno Vega. Una heurística eficaz para problemas de pre-marshalling en una terminal marítima de contenedores. 2012. 2

Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning. Theory and Practice. Elsevier Inc., 2004. 2.2

Mohamed Gheith, Amr Eltawil, N. A. Harraz, and S. Mizuno. Container Pre-marshalling Problem: A Review and Solution Framework. In Proc. of the IEEE International Conference of Industrial Engineering and Engineering Management, pages 283–287, Hong Kong, 2012. (document), 2

Mohamed Gheith, Amr Eltawil, N. A. Harraz, and S. Mizuno. An Integer Programming Formulation and Solution for the Container Pre-marshalling Problem. pages 2047–2056, Istanbul, Turkey, 2014. 1.1

Fred Glover. Tabu search and adaptive memory programming— advances, applications and challenges. In Interfaces in computer science and operations research, pages 1–75. Springer US, 1997. 2

Loo Hay Lee, Xinjia Jiang, Lu Zhen, and Ek Peng Chew. A Review on Yard Management in Container Terminals. Industrial Engineering & Management Systems, 12(4):289–305, 2013. (document)

Frederick S. Hillier and Gerald J. Lieberman. Introduction to operations research. The McGraw-Hill Companies, Inc, ninth edition, 2010. 1, 1.1, 1.1

Jhon Holland. Adaptive in natural and artificial systems. Ann Arbor, Univ. Michigan Press, 1975. 2

Dong-liang Hou and Fang-rong Chen. Constraint Satisfaction Technology for Stacking Problem with Ordered Constraints. Procedia Engineering, 29:3317–3321, 2012. 2.2

Kap Hwan Kim and Gyu-Pyo Hong. A heuristic rule for relocating blocks. Computers & Operations Research, 33:940–954, 2006. 2

Hyeonguk Jang, Ri Choe, and Kwang Ryel Ryu. Deriving a Robust Policy for Container Stacking Using a Noise-Tolerant Genetic Algorithm. In Proc. of the 2012 ACM Research in Applied Computation Symposium, pages 31–36, San Antonio, TX, USA., 2012. 2.1

Bo Jin, Wenbin Zhu, and Andrew Lim. Solving the container relocation problem by an improved greedy look-ahead heuristic. European Journal of Operational Research, 240(3):837–847, 2015. 2

Raka Jovanovic, Milan Tuba, and Stefan Voss. A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem. 2015. 2

Shuding Kang and Weimin Wu. A Genetic Algorithm to Solve the Containers Location Allocation Problem in Rear Storage Yard. In Proc. of the IEEE 12th International Conference on Networking, Sensing and Control, pages 33–38, Taipei, Taiwan, 2015. 2.1

M. Kefi, O. Korbaa, K. Ghedira, and P. Yim. Heuristic based model for container stacking problem. In Proc. of the 19 International Conference on Production Research, volume 7, 2007. 2

James Kennedy and Russell Eberhart. A New Optimizer Using Particle Swarm Theory. In Proc. of the Sixth International Symposium on Micro Machine and Human Science, 1995. 2

Kap Hwan Kim, Young Man Park, and Kwang-Ryul Ryu. Deriving decision rules to locate export containers in container yards. European Journal of Operational Research, 124:89–101, 2000. 1.2

Yusin Lee and Shih-Liang Chao. A neighborhood search heuristic for pre-marshalling export containers. European Journal of Operational Research, 196(2):468–475, 2009. 2

Yusin Lee and Nai-Yun Hsu. An optimization model for the container pre-marshalling problem. Computers & Operations Research, 34(11):3295 – 3313, 2007. 1.1, 2

Jana Lehnfeld and Sigrid Knust. Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. European Journal of Operational Research, 239(2):297– 312, 2014. (document)

Richard Linn, Jiyin Liu, Yat-wah Wan, and Katta G. Murty. A decision support system for operations in a container terminal. Decision Support Systems, 39:309–332, 2005. 2

Patrick J.M Meersmans and Rommert Dekker. Operation Research supports container handling. Econometric Institute Report EI 2001-22, Econometric Institute, Erasmus University Rotterdam, 2001. (document)

Nd`eye Fatma Ndiaye, Adnan Yassine, and Ibrahima Diarrassouba. Hybrid Algorithms to Solve the Container Stacking Problem at Seaport. Journal of Mathematics, Statistics and Operations Research (JMSOR), 2(2):44–56, 2014. 2.1

Nd`eye Fatma Ndiaye, Adnan Yassine, and Ibrahima Diarrassouba. A Hybrid Ant Colony and Genetic Algorithm to solve the Container Stacking Problem at Seaport Terminal. In Proc. of the 2014 International Conference on Advanced Logistics and Transport (ICALT), pages 247–252. IEEE, 2014. 2.1

Matthias Prandtstetter. A Dynamic Programming Based Branch-And-Bound Algorithm for the Container Pre-Marshalling Problem. Technical report, AIT Austrian Institute of Technology,, 2013. 1.2

C. R. Reeves. Modern Heuristic Search Methods. In Modern heuristic techniques, pages 1–25. Wiley, New York, 1996. 2.1

Rui Jorge Rei and Joao Pedro Pedroso. Heuristic search for the stacking problem. Internacional Transactions in Operational Research, 19(3):379–395, 2011. 2

Andrea Rendl and Matthias Prandtstetter. Constraint Models for the Container Pre-Marshaling Problem. In Proc. of the ModRef 2013: The Twelfth International Workshop on Constraint Modelling and Reformulation, pages 44–55, Uppsala, Sweden, 2013. 2.2

Mario Rodriguez-Molins, Miguel A. Salido, and Federico Barber. Intelligent planning for allocating containers in maritime terminals. Expert Systems with Applications, 39(1):978–989, 2012. 2.2

Miguel A. Salido and Federico Barber. Introduction to constraint programming. Revista Iberoamericana de Inteligencia Artificial, (20):13–30, 2003. 2.2

Miguel A. Salido, Oscar Sapena, and Federico Barber. An Artificial Intelligence Planning tool for The Container Stacking Problem. pages 1–4, September 2009. 2.2

Phatchara Sriphrabu, Kanchana Sethanan, and Banchar Arnonkijpanich. A Solution of the Container Stacking Problem by Genetic Algorithm. IACSIT International Journal of Engineering and Technology, 5(1):45–49, 2013. 2.1

Lixin Tang, Wei Jiang, Jiyin Liu, and Yun Dong. Research into container reshuffling and stacking problems in container terminal yards. IIE Transactions, 47(7):751–766, 2015. 2

Yat-wahWan, Jiyin Liu, and Pei-Chun Tsai. The Assignment of Storage Locations to Containers for a Container Stack. Naval Research Logistics, 56(8):700–713, 2009. 1.1, 2

Xiaoming Yang, Ning Zhao, Zhicheng Bian, Jiaqi Chai, and Mi Chao. An Intelligent Storage Determining Method for Inbound Containers in Container Terminals. Journal of Coastal Research, 73(sp1):197–204, 2015. 1.1

Descargas

Publicado

2017-06-01

Cómo citar

[1]
De Armas Jacomino, L. et al. 2017. Métodos de optimización aplicados al problema de apilamiento de contenedores. Ciencias matemáticas. 31, 1 (jun. 2017), 25–34.

Número

Vol. 31 Núm. 1: Junio, 2017

Sección

Artículo Original

Licencia

Derechos de autor 2024 Ciencias Matemáticas

Creative Commons License

Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.

Esta licencia permite copiar y redistribuir el material en cualquier medio o formato bajo los siguientes términos: se debe dar crédito de manera adecuada, no se puede hacer uso del material con propósitos comerciales, y si remezcla, transforma o crea a partir del material, no podrá distribuir el material modificado. Bajo la licencia mencionada, los autores mantienen los derechos de autor de su trabajo.