{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:29:01Z","timestamp":1772760541668,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:00:00Z","timestamp":1447200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"SpanishMinistry of Economy and Competitiveness","award":["TIN2012-32608"],"award-info":[{"award-number":["TIN2012-32608"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10479-015-2055-6","type":"journal-article","created":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T10:32:53Z","timestamp":1447237973000},"page":"871-897","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations"],"prefix":"10.1007","volume":"253","author":[{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Exp\u00f3sito-Izquierdo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bel\u00e9n","family":"Meli\u00e1n-Batista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Marcos","family":"Moreno-Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,11]]},"reference":[{"key":"2055_CR1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1057\/mel.2010.11","volume":"12","author":"JF Alvarez","year":"2010","unstructured":"Alvarez, J. F., Longva, T., & Engebrethsen, E. S. (2010). A methodology to assess vessel berthing and speed optimization policies. Maritime Economics and Logistics, 12, 327\u2013346.","journal-title":"Maritime Economics and Logistics"},{"issue":"2","key":"2055_CR2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2007.10.002","volume":"192","author":"ACF Alvim","year":"2009","unstructured":"Alvim, A. C. F., & Taillard, \u00c9. D. (2009). POPMUSIC for the point feature label placement problem. European Journal of Operational Research, 192(2), 396\u2013413.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2055_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s13676-013-0024-2","volume":"2","author":"ACF Alvim","year":"2013","unstructured":"Alvim, A. C. F., & Taillard, \u00c9. D. (2013). POPMUSIC for the world location-routing problem. EURO Journal on Transportation and Logistics, 2(3), 231\u2013254.","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"4","key":"2055_CR4","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"VH Barros","year":"2011","unstructured":"Barros, V. H., Costa, T. S., Oliveira, A. C. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers and Industrial Engineering, 60(4), 606\u2013613.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"2055_CR5","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C Bierwirth","year":"2010","unstructured":"Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615\u2013627.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2055_CR6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675\u2013689.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2055_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., & Lusby, R. (2011). Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E, 47(4), 461\u2013473.","journal-title":"Transportation Research Part E"},{"key":"2055_CR8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.trd.2010.12.005","volume":"16","author":"P Cariou","year":"2011","unstructured":"Cariou, P. (2011). Is slow steaming a sustainable means of reducing \n                        $$\\text{ CO }_2$$\n                        \n                            \n                                            \n                                \n                                    \n                                    CO\n                                    \n                                        \n                                        2\n                                    \n                                \n                            \n                        \n                     emissions from container shipping? Transportation Research Part D: Transport and Environment, 16, 260\u2013264.","journal-title":"Transportation Research Part D: Transport and Environment"},{"key":"2055_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-540-78297-1_16","volume-title":"Advances of computational intelligence in industrial systems, volume 116 of studies in computational intelligence","author":"C Cheong","year":"2008","unstructured":"Cheong, C., & Tan, K. (2008). A multi-objective multi-colony ant algorithm for solving the berth allocation problem. In Y. Liu, A. Sun, H. T. Loh, W. F. Lu, & E.-P. Lim (Eds.), Advances of computational intelligence in industrial systems, volume 116 of studies in computational intelligence (Vol. 116, pp. 333\u2013350). Berlin: Springer."},{"key":"2055_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"C Cheong","year":"2010","unstructured":"Cheong, C., Tan, K., Liu, D., & Lin, C. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research, 180, 63\u2013103.","journal-title":"Annals of Operations Research"},{"key":"2055_CR11","first-page":"189","volume-title":"Transportation volume 14 of handbooks in operations research and management science","author":"M Christiansen","year":"2007","unstructured":"Christiansen, M., Fagerholt, K., Nygreen, B., & Ronen, D. (2007). Maritime transportation. In C. Barnhart & G. Laporte (Eds.), Transportation volume 14 of handbooks in operations research and management science (pp. 189\u2013284). Amsterdam: Elsevier."},{"key":"2055_CR12","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J. F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526\u2013538.","journal-title":"Transportation Science"},{"key":"2055_CR13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-642-53856-8_41","volume":"8111","author":"C Exp\u00f3sito-Izquierdo","year":"2013","unstructured":"Exp\u00f3sito-Izquierdo, C., Lalla-Ruiz, E., Meli\u00e1n Batista, B., & Moreno-Vega, J. M. (2013). Optimization of container terminal problems. Lecture Notes in Computer Science, 8111, 324\u2013331.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"2055_CR14","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","volume":"44","author":"G Giallombardo","year":"2010","unstructured":"Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232\u2013245.","journal-title":"Transportation Research Part B: Methodological"},{"key":"2055_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-25944-9_10","volume":"6839","author":"E Guldogan","year":"2012","unstructured":"Guldogan, E., Bulut, O., & Tasgetiren, M. F. (2012). A dynamic berth allocation problem with priority considerations under stochastic nature. Lecture Notes in Computer Science, 6839, 74\u201382.","journal-title":"Lecture Notes in Computer Science"},{"key":"2055_CR16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-642-78910-6_28","volume-title":"Operations research proceedings 1993","author":"L Hoffarth","year":"1994","unstructured":"Hoffarth, L., & Vo\u00df, S. (1994). Liegeplatzdisposition auf einem Container Terminal\u2014Ans\u00e4tze zur Entwicklung eines entscheidungsunterst\u00fctzenden Systems. In H. Dyckhoff, U. Derigs, M. Salomon, & H. C. Tijms (Eds.), Operations research proceedings 1993 (pp. 89\u201395). Berlin: Springer."},{"issue":"4","key":"2055_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","author":"A Imai","year":"2001","unstructured":"Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401\u2013417.","journal-title":"Transportation Research Part B: Methodological"},{"key":"2055_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tre.2014.09.013","volume":"72","author":"A Imai","year":"2014","unstructured":"Imai, A., Yamakawa, Y., & Huang, K. (2014). The strategic berth template problem. Transportation Research Part E: Logistics and Transportation Review, 72, 77\u2013100.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1\u20134","key":"2055_CR19","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s00170-012-4186-0","volume":"65","author":"J Karafa","year":"2013","unstructured":"Karafa, J., Golias, M. M., Ivey, S., Saharidis, G. K. D., & Leonardos, N. (2013). The berth allocation problem with stochastic vessel handling times. The International Journal of Advanced Manufacturing Technology, 65(1\u20134), 473\u2013484.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"2055_CR20","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.asoc.2014.04.035","volume":"22","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., Gonz\u00e1lez-Velarde, J. L., Meli\u00e1n-Batista, B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing, 22, 60\u201376.","journal-title":"Applied Soft Computing"},{"key":"2055_CR21","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-319-09584-4_20","volume":"8426","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2014a). Towards a matheuristic approach for the berth allocation problem. Lecture Notes in Computer Science, 8426, 218\u2013222.","journal-title":"Lecture Notes in Computer Science"},{"key":"2055_CR22","doi-asserted-by":"publisher","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2014b). POPMUSIC as a matheuristic for the berth allocation problem. Annals of Mathematics and Artificial Intelligence. doi:\n                        10.1007\/s10472-014-9444-4\n                        \n                    .","DOI":"10.1007\/s10472-014-9444-4"},{"issue":"1","key":"2055_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.tre.2012.08.006","volume":"49","author":"D-H Lee","year":"2013","unstructured":"Lee, D.-H., & Jin, J. G. (2013). Feeder vessel management at container transshipment terminals. Transportation Research Part E: Logistics and Transportation Review, 49(1), 201\u2013216.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"2055_CR24","volume-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming. Annals of Information Systems","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., & Vo\u00df, S. (Eds.). (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming. Annals of Information Systems (Vol. 10). New York: Springer."},{"key":"2055_CR25","doi-asserted-by":"crossref","unstructured":"Meyer, J., Stahlbock, R., & Vo\u00df, S. (2012). Slow steaming in container shipping. In R. H. Sprague (Ed.), Proceedings of the 45th annual Hawaii international conference on system sciences (HICSS 2012) (pp. 1306\u20131314). Piscataway: IEEE.","DOI":"10.1109\/HICSS.2012.529"},{"issue":"2","key":"2055_CR26","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131(2), 282\u2013292.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2055_CR27","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1057\/palgrave.mel.9100196","volume":"10","author":"T Notteboom","year":"2008","unstructured":"Notteboom, T., & Rodrigue, J.-P. (2008). Containerisation, box logistics and global supply chains: The integration of ports and liner shipping networks. Maritime Economics and Logistics, 10(1), 152\u2013174.","journal-title":"Maritime Economics and Logistics"},{"key":"2055_CR28","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1057\/palgrave.jors.2602633","volume":"60","author":"A Ostertag","year":"2009","unstructured":"Ostertag, A., Doerner, K. F., Hartl, R. F., Taillard, E. D., & Waelti, P. (2009). POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society, 60, 934\u2013943.","journal-title":"Journal of the Operational Research Society"},{"key":"2055_CR29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.trc.2012.09.012","volume":"26","author":"HN Psaraftis","year":"2013","unstructured":"Psaraftis, H. N., & Kontovas, C. A. (2013). Speed models for energy-efficient maritime transportation: A taxonomy and survey. Transportation Research Part C: Emerging Technologies, 26, 331\u2013351.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"4","key":"2055_CR30","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455\u2013472.","journal-title":"Transportation Science"},{"issue":"3","key":"2055_CR31","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., & Vo\u00df, S. (2006). The corridor method: A dynamic programming inspired metaheuristic. Control and Cybernetics, 35(3), 551\u2013578.","journal-title":"Control and Cybernetics"},{"key":"2055_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D Steenken","year":"2004","unstructured":"Steenken, D., Vo\u00df, S., & Stahlbock, R. (2004). Container terminal operation and operations research\u2014A classification and literature review. OR Spectrum, 26, 3\u201349.","journal-title":"OR Spectrum"},{"key":"2055_CR33","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and surveys in metaheuristics","author":"\u00c9 Taillard","year":"2002","unstructured":"Taillard, \u00c9., & Vo\u00df, S. (2002). POPMUSIC\u2014Partial optimization metaheuristic under special intensification conditions. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 613\u2013629). Boston: Kluwer."},{"key":"2055_CR34","unstructured":"User\u2019s manual for CPLEX. (2011). IBM Ilog CPLEX, 12.3."},{"key":"2055_CR35","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tre.2013.03.003","volume":"54","author":"N Umang","year":"2013","unstructured":"Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review, 54, 14\u201331.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"2055_CR36","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.1120.0428","volume":"47","author":"I Vacca","year":"2013","unstructured":"Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148\u2013161.","journal-title":"Transportation Science"},{"key":"2055_CR37","unstructured":"Vo\u00df, S. (2015). Berth allocation: Do we have it all wrong? Technical report, University of Hamburg, Institute of Information Systems."},{"key":"2055_CR38","unstructured":"Wiegmans, B. W., Rietveld, P., & Nijkamp, P. (2001). Container terminal services and quality. Serie Research Memoranda 0040, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics."},{"issue":"1","key":"2055_CR39","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ejor.2011.07.012","volume":"216","author":"D Xu","year":"2012","unstructured":"Xu, D., Li, C. L., & Leung, J. Y. T. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216(1), 47\u201356.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2055-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2055-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2055-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2055-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:05Z","timestamp":1559139005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2055-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,11]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["2055"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2055-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,11]]}}}