- -

Minimizing crane times in pre-marshalling problems

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Minimizing crane times in pre-marshalling problems

Mostrar el registro completo del ítem

Parreño-Torres, C.; Álvarez-Valdés, R.; Ruiz García, R.; Tierney, K. (2020). Minimizing crane times in pre-marshalling problems. Transportation Research Part E Logistics and Transportation Review. 137:1-20. https://doi.org/10.1016/j.tre.2020.101917

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/165899

Ficheros en el ítem

Thumbnail
Nombre: Parreño-Torres;Ál ...
Tamaño: 538.9Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir/Preview
[Cerrado]
Nombre: Published_Consuel ...
Tamaño: 2.320Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: Minimizing crane times in pre-marshalling problems
Autor: Parreño-Torres, Consuelo Álvarez-Valdés, Ramón Ruiz García, Rubén Tierney, Kevin
Entidad UPV: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Fecha difusión:
Resumen:
[EN] The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring ...[+]
Palabras clave: Logistics , Container pre-marshalling , Crane time , Maritime transport , Terminal operations
Derechos de uso: Reserva de todos los derechos
Fuente:
Transportation Research Part E Logistics and Transportation Review. (issn: 1366-5545 )
DOI: 10.1016/j.tre.2020.101917
Editorial:
Elsevier
Versión del editor: https://doi.org/10.1016/j.tre.2020.101917
Código del Proyecto:
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094940-B-I00/ES/OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS/
info:eu-repo/grantAgreement/MECD//A-2015-12849
Agradecimientos:
This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) ...[+]
Tipo: Artículo

References

Bacci, T., Mattia, S., & Ventura, P. (2019). The bounded beam search algorithm for the block relocation problem. Computers & Operations Research, 103, 252-264. doi:10.1016/j.cor.2018.11.008

Bortfeldt, A., & Forster, F. (2012). A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research, 217(3), 531-540. doi:10.1016/j.ejor.2011.10.005

van Brink, M., van der Zwaan, R., 2014. A branch and price procedure for the container premarshalling problem. In: Schulz, A., Wagner, D. (Eds.), Algorithms - ESA 2014. Springer, Berlin Heidelberg. volume 8737 of Lecture Notes in Computer Science, pp. 798–809. https://doi.org/10.1007/978-3-662-44777-2_66. [+]
Bacci, T., Mattia, S., & Ventura, P. (2019). The bounded beam search algorithm for the block relocation problem. Computers & Operations Research, 103, 252-264. doi:10.1016/j.cor.2018.11.008

Bortfeldt, A., & Forster, F. (2012). A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research, 217(3), 531-540. doi:10.1016/j.ejor.2011.10.005

van Brink, M., van der Zwaan, R., 2014. A branch and price procedure for the container premarshalling problem. In: Schulz, A., Wagner, D. (Eds.), Algorithms - ESA 2014. Springer, Berlin Heidelberg. volume 8737 of Lecture Notes in Computer Science, pp. 798–809. https://doi.org/10.1007/978-3-662-44777-2_66.

Caserta, M., Schwarze, S., Voß, S., 2011. Container rehandling at maritime container terminals, in: Böse, J. (Ed.), Handbook of Terminal Planning. Springer, New York. volume 49 of Operations Research/Computer Science Interfaces Series, pp. 247–269. https://doi.org/10.1007/978-1-4419-8408-1_13.

Expósito-Izquierdo, C., Melián-Batista, B., & Moreno-Vega, M. (2012). Pre-Marshalling Problem: Heuristic solution method and instances generator. Expert Systems with Applications, 39(9), 8337-8349. doi:10.1016/j.eswa.2012.01.187

Hottung, A., Tanaka, S., & Tierney, K. (2020). Deep learning assisted heuristic tree search for the container pre-marshalling problem. Computers & Operations Research, 113, 104781. doi:10.1016/j.cor.2019.104781

Jovanovic, R., Tanaka, S., Nishi, T., & Voß, S. (2018). A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan. Flexible Services and Manufacturing Journal, 31(3), 702-729. doi:10.1007/s10696-018-9320-3

Jovanovic, R., Tuba, M., & Voß, S. (2015). A multi-heuristic approach for solving the pre-marshalling problem. Central European Journal of Operations Research, 25(1), 1-28. doi:10.1007/s10100-015-0410-y

Jovanovic, R., Tuba, M., & Voß, S. (2019). An efficient ant colony optimization algorithm for the blocks relocation problem. European Journal of Operational Research, 274(1), 78-90. doi:10.1016/j.ejor.2018.09.038

Lee, Y., & Chao, S.-L. (2009). A neighborhood search heuristic for pre-marshalling export containers. European Journal of Operational Research, 196(2), 468-475. doi:10.1016/j.ejor.2008.03.011

Lee, Y., & Hsu, N.-Y. (2007). An optimization model for the container pre-marshalling problem. Computers & Operations Research, 34(11), 3295-3313. doi:10.1016/j.cor.2005.12.006

Lee, Y., & Lee, Y.-J. (2010). A heuristic for retrieving containers from a yard. Computers & Operations Research, 37(6), 1139-1147. doi:10.1016/j.cor.2009.10.005

Lehnfeld, J., & Knust, S. (2014). Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. European Journal of Operational Research, 239(2), 297-312. doi:10.1016/j.ejor.2014.03.011

Lin, D.-Y., Lee, Y.-J., & Lee, Y. (2015). The container retrieval problem with respect to relocation. Transportation Research Part C: Emerging Technologies, 52, 132-143. doi:10.1016/j.trc.2015.01.024

Parreño-Torres, C., Alvarez-Valdes, R., & Ruiz, R. (2019). Integer programming models for the pre-marshalling problem. European Journal of Operational Research, 274(1), 142-154. doi:10.1016/j.ejor.2018.09.048

Prandtstetter, M., 2013. A dynamic programming based branch-and-bound algorithm for the container pre-marshalling problem. Technical Report. Technical report, AIT Austrian Institute of Technology.

Quispe, K. E. Y., Lintzmayer, C. N., & Xavier, E. C. (2018). An exact algorithm for the Blocks Relocation Problem with new lower bounds. Computers & Operations Research, 99, 206-217. doi:10.1016/j.cor.2018.06.021

De Melo da Silva, M., Toulouse, S., & Wolfler Calvo, R. (2018). A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. European Journal of Operational Research, 271(1), 40-56. doi:10.1016/j.ejor.2018.05.004

Da Silva Firmino, A., de Abreu Silva, R. M., & Times, V. C. (2018). A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time. Journal of Heuristics, 25(2), 141-173. doi:10.1007/s10732-018-9390-0

Tanaka, S., & Mizuno, F. (2018). An exact algorithm for the unrestricted block relocation problem. Computers & Operations Research, 95, 12-31. doi:10.1016/j.cor.2018.02.019

Tanaka, S., & Tierney, K. (2018). Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm. European Journal of Operational Research, 264(1), 165-180. doi:10.1016/j.ejor.2017.05.046

Tanaka, S., Tierney, K., Parreño-Torres, C., Alvarez-Valdes, R., & Ruiz, R. (2019). A branch and bound approach for large pre-marshalling problems. European Journal of Operational Research, 278(1), 211-225. doi:10.1016/j.ejor.2019.04.005

Tanaka, S., & Voß, S. (2019). An exact algorithm for the block relocation problem with a stowage plan. European Journal of Operational Research, 279(3), 767-781. doi:10.1016/j.ejor.2019.06.014

Tierney, K., Pacino, D., & Voß, S. (2016). Solving the pre-marshalling problem to optimality with A* and IDA*. Flexible Services and Manufacturing Journal, 29(2), 223-259. doi:10.1007/s10696-016-9246-6

UNCTAD, 2018. United Nations Conference on Trade and Development (UNCTAD) Review of Maritime Transport. United Nations. <https://unctad.org/en/PublicationsLibrary/rmt2018_en.pdf>.

Wang, N., Jin, B., & Lim, A. (2015). Target-guided algorithms for the container pre-marshalling problem. Omega, 53, 67-77. doi:10.1016/j.omega.2014.12.002

Wang, N., Jin, B., Zhang, Z., & Lim, A. (2017). A feasibility-based heuristic for the container pre-marshalling problem. European Journal of Operational Research, 256(1), 90-101. doi:10.1016/j.ejor.2016.05.061

Zhang, R., Liu, S., & Kopfer, H. (2015). Tree search procedures for the blocks relocation problem with batch moves. Flexible Services and Manufacturing Journal, 28(3), 397-424. doi:10.1007/s10696-015-9229-z

Zhu, H., Ji, M., Guo, W., Wang, Q., & Yang, Y. (2019). Mathematical formulation and heuristic algorithm for the block relocation and loading problem. Naval Research Logistics (NRL), 66(4), 333-351. doi:10.1002/nav.21843

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem