{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:21:26Z","timestamp":1779247286723,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T00:00:00Z","timestamp":1536105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10732-018-9390-0","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T13:50:55Z","timestamp":1536155455000},"page":"141-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["A reactive GRASP metaheuristic for the container retrieval problem to reduce crane\u2019s working time"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7586-2604","authenticated-orcid":false,"given":"Andresson","family":"da Silva Firmino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo Martins","family":"de Abreu Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Val\u00e9ria Ces\u00e1rio","family":"Times","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,5]]},"reference":[{"issue":"6","key":"9390_CR1","first-page":"2722","volume":"22","author":"E Azari","year":"2015","unstructured":"Azari, E.: Notes on \u201cA mathematical formulation and complexity considerations for the blocks relocation problem\u201d. Sci. Iran. 22(6), 2722\u20132728 (2015)","journal-title":"Sci. Iran."},{"issue":"2","key":"9390_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"HJ Carlo","year":"2014","unstructured":"Carlo, H.J., Vis, I.F., Roodbergen, K.J.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412\u2013430 (2014). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2013.10.054","journal-title":"Eur. J. Oper. Res."},{"key":"9390_CR3","doi-asserted-by":"crossref","unstructured":"Carraro, L.A., De Castro L.N.: A clonal selection algorithm for the container stacking problem. In: Proceedings of the 2011 3rd World Congress on Nature and Biologically Inspired Computing, pp 569\u2013574. IEEE (2011). \n                    https:\/\/doi.org\/10.1109\/NaBIC.2011.6089651","DOI":"10.1109\/NaBIC.2011.6089651"},{"issue":"4","key":"9390_CR4","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectr. 33(4), 915\u2013929 (2011). \n                    https:\/\/doi.org\/10.1007\/s00291-009-0176-5","journal-title":"OR Spectr."},{"issue":"1","key":"9390_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","volume":"219","author":"M Caserta","year":"2012","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219(1), 96\u2013104 (2012). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2011.12.039","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"9390_CR6","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/S0895-7177(00)00092-3","volume":"63","author":"B Casey","year":"2012","unstructured":"Casey, B., Kozan, E.: Optimising container storage processes at multimodal terminals. J. Oper. Res. Soc. 63(8), 1126\u20131142 (2012). \n                    https:\/\/doi.org\/10.1016\/S0895-7177(00)00092-3","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9390_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10732-010-9129-z","volume":"17","author":"Y Deng","year":"2011","unstructured":"Deng, Y., Bard, J.F.: A reactive grasp with path relinking for capacitated clustering. J. Heuristics 17(2), 119\u2013152 (2011). \n                    https:\/\/doi.org\/10.1007\/s10732-010-9129-z","journal-title":"J. Heuristics"},{"key":"9390_CR8","doi-asserted-by":"crossref","unstructured":"de Melo da Silva M, Erdo\u011fan, G., Battarra, M., Strusevich V.: The block retrieval problem. Eur. J. Oper. Res. 265(3), 931\u2013950 (2018). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2017.08.048","DOI":"10.1016\/j.ejor.2017.08.048"},{"issue":"9","key":"9390_CR9","doi-asserted-by":"publisher","first-page":"8337","DOI":"10.1016\/j.eswa.2012.01.187","volume":"39","author":"C Exp\u00f3sito-Izquierdo","year":"2012","unstructured":"Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst. Appl. 39(9), 8337\u20138349 (2012). \n                    https:\/\/doi.org\/10.1016\/j.eswa.2012.01.187","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"9390_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.aei.2014.03.003","volume":"28","author":"C Exp\u00f3sito-Izquierdo","year":"2014","unstructured":"Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: A domain-specific knowledge-based heuristic for the blocks relocation problem. Adv. Eng. Inform. 28(4), 327\u2013343 (2014). \n                    https:\/\/doi.org\/10.1016\/j.aei.2014.03.003","journal-title":"Adv. Eng. Inform."},{"issue":"17\u201318","key":"9390_CR11","doi-asserted-by":"publisher","first-page":"6408","DOI":"10.1016\/j.eswa.2015.04.021","volume":"42","author":"C Exp\u00f3sito-Izquierdo","year":"2015","unstructured":"Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: An exact approach for the blocks relocation problem. Expert Syst. Appl. 42(17\u201318), 6408\u20136422 (2015). \n                    https:\/\/doi.org\/10.1016\/j.eswa.2015.04.021","journal-title":"Expert Syst. Appl."},{"key":"9390_CR12","doi-asserted-by":"crossref","unstructured":"Firmino, A.S., Silva, R.M.A., Times, V.C.: An exact approach for the container retrieval problem to reduce crane\u2019s trajectory. In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), pp 933\u2013938 (2016a). \n                    https:\/\/doi.org\/10.1109\/itsc.2016.7795667","DOI":"10.1109\/ITSC.2016.7795667"},{"key":"9390_CR13","unstructured":"Firmino, A.S., Times, V.C., Silva, R.M.A., Mateus, G.R.: Reactive grasp with path relinking for selecting olap views. In: XLVIII SBPO (2016) (2016b). \n                    www.sbpo2016.iltc.br\/pdf\/156026.pdf"},{"key":"9390_CR14","doi-asserted-by":"crossref","unstructured":"Forster, F., Bortfeldt, A.: A tree search heuristic for the container retrieval problem. In: Klatte D, L\u00fcthi HJ, Schmedders K (eds) Operations Research Proceedings 2011 SE - 41, Operations Research Proceedings, pp. 257\u2013262. Springer, Berlin (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29210-1_41","DOI":"10.1007\/978-3-642-29210-1_41"},{"key":"9390_CR15","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ejor.2017.11.053","volume":"267","author":"V Galle","year":"2018","unstructured":"Galle, V., Barnhart, C., Jaillet, P.: A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations. Eur. J. Oper. Res. 267, 467\u2013477 (2018). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2017.11.053","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9390_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/nav.21569","volume":"61","author":"M Hakan Aky\u00fcz","year":"2014","unstructured":"Hakan Aky\u00fcz, M., Lee, C.Y.: A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Nav. Res. Logist. 61(2), 101\u2013118 (2014). \n                    https:\/\/doi.org\/10.1002\/nav.21569","journal-title":"Nav. Res. Logist."},{"key":"9390_CR17","doi-asserted-by":"crossref","unstructured":"Hussein, M., Petering, M.E.H.: Genetic algorithm-based simulation optimization of stacking algorithms for yard cranes to reduce fuel consumption at seaport container transshipment terminals. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2012). \n                    https:\/\/doi.org\/10.1109\/CEC.2012.6256471","DOI":"10.1109\/CEC.2012.6256471"},{"issue":"3","key":"9390_CR18","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2014.07.038","volume":"240","author":"B Jin","year":"2015","unstructured":"Jin, B., Zhu, W., Lim, A.: Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur. J. Oper. Res. 240(3), 837\u2013847 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2014.07.038","journal-title":"Eur. J. Oper. Res."},{"key":"9390_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","volume":"75","author":"R Jovanovic","year":"2014","unstructured":"Jovanovic, R., Vo\u00df, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79\u201386 (2014). \n                    https:\/\/doi.org\/10.1016\/j.cie.2014.06.010","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9390_CR20","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"KH Kim","year":"2006","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33(4), 940\u2013954 (2006). \n                    https:\/\/doi.org\/10.1016\/j.cor.2004.08.005","journal-title":"Comput. Oper. Res."},{"key":"9390_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.08.022","author":"Y Kim","year":"2016","unstructured":"Kim, Y., Kim, T., Lee, H.: Heuristic algorithm for retrieving containers. Comput. Ind. Eng. (2016). \n                    https:\/\/doi.org\/10.1016\/j.cie.2016.08.022","journal-title":"Comput. Ind. Eng."},{"key":"9390_CR22","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2015.11.006","volume":"68","author":"D Ku","year":"2016","unstructured":"Ku, D., Arthanari, T.S.: On the abstraction method for the container relocation problem. Comput. Oper. Res. 68, 110\u2013122 (2016). \n                    https:\/\/doi.org\/10.1016\/j.cor.2015.11.006","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9390_CR23","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.cor.2009.10.005","volume":"37","author":"Y Lee","year":"2010","unstructured":"Lee, Y., Lee, Y.J.: A heuristic for retrieving containers from a yard. Comput. Oper. Res. 37(6), 1139\u20131147 (2010). \n                    https:\/\/doi.org\/10.1016\/j.cor.2009.10.005","journal-title":"Comput. Oper. Res."},{"key":"9390_CR24","doi-asserted-by":"crossref","unstructured":"Li, J., Yu, H.X.: Optimizing retrieval sequencing in container yards. In: Proceedings\u20142010 International Conference on Optoelectronics and Image Processing, IEEE, vol.\u00a02, pp.\u00a090\u201392 (2010). \n                    https:\/\/doi.org\/10.1109\/ICOIP.2010.236","DOI":"10.1109\/ICOIP.2010.236"},{"key":"9390_CR25","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.trc.2015.01.024","volume":"52","author":"DY Lin","year":"2015","unstructured":"Lin, D.Y., Lee, Y.J., Lee, Y.: The container retrieval problem with respect to relocation. Transp. Res. C Emerg. Technol. 52, 132\u2013143 (2015). \n                    https:\/\/doi.org\/10.1016\/j.trc.2015.01.024","journal-title":"Transp. Res. C Emerg. Technol."},{"issue":"3","key":"9390_CR26","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.dss.2003.11.002","volume":"39","author":"KG Murty","year":"2005","unstructured":"Murty, K.G., Liu, J., Yw, Wan, Linn, R.: A decision support system for operations in a container terminal. Decis. Support Syst. 39(3), 309\u2013332 (2005). \n                    https:\/\/doi.org\/10.1016\/j.dss.2003.11.002","journal-title":"Decis. Support Syst."},{"key":"9390_CR27","doi-asserted-by":"crossref","unstructured":"Olsen, M., Gross, A.: Average case analysis of blocks relocation heuristics. In: Gonz\u00e1lez-Ram\u00edrez, R.G., Schulte, F., Vo\u00df, S., Ceroni\u00a0D\u00edaz, J.A. (eds.) Computational Logistics. ICCL 2014, pp. 81\u201392. Springer International Publishing (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11421-7_6","DOI":"10.1007\/978-3-319-11421-7_6"},{"issue":"1","key":"9390_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2013.05.037","volume":"231","author":"ME Petering","year":"2013","unstructured":"Petering, M.E., Hussein, M.I.: A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur. J. Oper. Res. 231(1), 120\u2013130 (2013). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2013.05.037","journal-title":"Eur. J. Oper. Res."},{"key":"9390_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP: Greedy Randomized Adaptive Search Procedures","author":"M Resende","year":"2016","unstructured":"Resende, M., Ribeiro, C.: Optimization by GRASP: Greedy Randomized Adaptive Search Procedures. Springer, New York (2016). \n                    https:\/\/doi.org\/10.1007\/978-1-4939-6530-4"},{"key":"9390_CR30","volume-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"DJ Sheskin","year":"2007","unstructured":"Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 4th edn. Chapman & Hall\/CRC, Boca Raton (2007)","edition":"4"},{"issue":"1","key":"9390_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TASE.2015.2434417","volume":"13","author":"S Tanaka","year":"2016","unstructured":"Tanaka, S., Takii, K.: A faster branch-and-bound algorithm for the block relocation problem. Autom. Sci. Eng. 13(1), 181\u2013190 (2016). \n                    https:\/\/doi.org\/10.1109\/TASE.2015.2434417","journal-title":"Autom. Sci. Eng."},{"key":"9390_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tre.2017.04.010","volume":"103","author":"CJ Ting","year":"2017","unstructured":"Ting, C.J., Wu, K.C.: Optimizing container relocation operations at container yards with beam search. Transp. Res. E Logist. Transp. Rev. 103, 17\u201331 (2017). \n                    https:\/\/doi.org\/10.1016\/j.tre.2017.04.010","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"9390_CR33","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/J.COR.2017.08.010","volume":"89","author":"F Tricoire","year":"2018","unstructured":"Tricoire, F., Scagnetti, J., Beham, A.: New insights on the block relocation problem. Comput. Oper. Res. 89, 127\u2013139 (2018). \n                    https:\/\/doi.org\/10.1016\/J.COR.2017.08.010","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9390_CR34","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/atr.1193","volume":"46","author":"T \u00dcnl\u00fcyurt","year":"2012","unstructured":"\u00dcnl\u00fcyurt, T., Aydin, C.: Improved rehandling strategies for the container retrieval process. J. Adv. Transp. 46(4), 378\u2013393 (2012). \n                    https:\/\/doi.org\/10.1002\/atr.1193","journal-title":"J. Adv. Transp."},{"issue":"8","key":"9390_CR35","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1002\/nav.20373","volume":"56","author":"Y Wan","year":"2009","unstructured":"Wan, Y., Liu, J., Tsai, P.C.: The assignment of storage locations to containers for a container stack. Nav. Res. Logist. 56(8), 699\u2013713 (2009). \n                    https:\/\/doi.org\/10.1002\/nav.20373","journal-title":"Nav. Res. Logist."},{"key":"9390_CR36","unstructured":"World Bank: Container port traffic (teu: 20 foot equivalent units) (2018). \n                    http:\/\/data.worldbank.org\/indicator\/IS.SHP.GOOD.TU?end=2018&start=2000\n                    \n                  . Accessed 04 June 2018"},{"key":"9390_CR37","unstructured":"Wu, K.C., Ting, C.J.: A beam search algorithm for minimizing reshuffle operations at container yards. In: International Conference on Logistics and Maritime Systems, pp. 15\u201317 (2010)"},{"key":"9390_CR38","unstructured":"Wu, K.C., Ting, C.J.: Heuristic approaches for minimizing reshuffle operations at container yard. In: Kachitvichyanukul, V., Luong, H.T., Pitakaso, R. (eds.) Asia Pacific Industrial Engineering and Management Systems Conference, pp. 1407\u20131415 (2012)"},{"issue":"2","key":"9390_CR39","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.ejor.2015.03.032","volume":"245","author":"E Zehendner","year":"2015","unstructured":"Zehendner, E., Caserta, M., Feillet, D., Schwarze, S., Vo\u00df, S.: An improved mathematical formulation for the blocks relocation problem. Eur. J. Oper. Res. 245(2), 415\u2013422 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.03.032","journal-title":"Eur. J. Oper. Res."},{"key":"9390_CR40","unstructured":"Zhang, C.: Resource planning in container storage yard. Ph.D. thesis, Hong Kong University of Science and Technology (2000)"},{"key":"9390_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, H., Guo, S., Zhu, W., Lim, A., Cheang, B.: An investigation of ida* algorithms for the container relocation problem. In: Garc\u00eda-Pedrajas, N., Herrera, F., Fyfe, C., Ben\u00edtez, J.M., Ali, M. (eds.) Trends in Applied Intelligent Systems SE - 4, Lecture Notes in Computer Science, vol. 6096, pp. 31\u201340. Springer, Berlin (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13022-9_4","DOI":"10.1007\/978-3-642-13022-9_4"},{"issue":"4","key":"9390_CR42","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TASE.2012.2198642","volume":"9","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Qin, H., Lim, A., Zhang, H.: Iterative deepening a* algorithms for the container relocation problem. Autom. Sci. Eng. 9(4), 710\u2013722 (2012). \n                    https:\/\/doi.org\/10.1109\/TASE.2012.2198642","journal-title":"Autom. Sci. Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9390-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9390-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9390-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T19:17:14Z","timestamp":1567624634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9390-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,5]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9390"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9390-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,5]]},"assertion":[{"value":"5 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}