{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T03:06:19Z","timestamp":1782183979453,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,12,31]],"date-time":"2014-12-31T00:00:00Z","timestamp":1419984000000},"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":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10472-014-9444-4","type":"journal-article","created":{"date-parts":[[2014,12,30]],"date-time":"2014-12-30T13:23:02Z","timestamp":1419945782000},"page":"173-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["POPMUSIC as a matheuristic for the berth allocation problem"],"prefix":"10.1007","volume":"76","author":[{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,31]]},"reference":[{"issue":"3","key":"9444_CR1","first-page":"231","volume":"2","author":"A Alvim","year":"2013","unstructured":"Alvim, A., Taillard, E.: Popmusic for the world location-routing problem. Eur. J. Oper. Res. 2(3), 231\u2013254 (2013). doi: 10.1007\/s13676-013-0024-2","journal-title":"Eur. J. Oper. Res."},{"key":"9444_CR2","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.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202, 615\u2013627 (2010). doi: 10.1016\/j.ejor.2009.05.031","journal-title":"Eur. J. Oper. Res."},{"key":"9444_CR3","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.: Models for the discrete berth allocation problem: a computational comparison. Transp. Res. E 47, 461\u2013473 (2011). doi: 10.1016\/j.tre.2010.11.016","journal-title":"Transp. Res. E"},{"key":"9444_CR4","unstructured":"Christensen, C., Holst, C.: Berth allocation in container terminals. Master\u2019s thesis, Technical University of Denmark (2008)"},{"key":"9444_CR5","doi-asserted-by":"crossref","unstructured":"Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Chapter 4. Maritime transportation. In: C. Barnhart, G. Laporte (eds.) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 189\u2013284. Elsevier (2007), doi: 10.1016\/S0927-0507(06)14004-9","DOI":"10.1016\/S0927-0507(06)14004-9"},{"key":"9444_CR6","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"J Cordeau","year":"2005","unstructured":"Cordeau, J., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 39, 526\u2013538 (2005). doi: 10.1287\/trsc.1050.0120","journal-title":"Transp. Sci."},{"issue":"2","key":"9444_CR7","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2005.09.004","volume":"176","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Gaudioso, M., Laporte, G., Moccia, L.: The service allocation problem at the Gioia Tauro maritime terminal. Eur. J. Oper. Res. 176(2), 1167\u20131184 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9444_CR8","doi-asserted-by":"crossref","unstructured":"Hoffarth, L., Vo\u00df, S.: Liegeplatzdisposition auf einem Container Terminal - Ansatze zur Entwicklung eines entscheidungsunterst\u00fctzenden Systems\u0308. In: H. Dyckhoff, U. Derigs, M. Salomon, H. Tijms (eds.) Operations Research Proceedings 1993, pp. 89\u201395. Springer, Berlin (1994), doi: 10.1007\/978-3-642-78910-6_28","DOI":"10.1007\/978-3-642-78910-6_28"},{"key":"9444_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2014.01.003","volume":"70","author":"QM Hu","year":"2014","unstructured":"Hu, Q.M., Hu, Z.H., Du, Y.: Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Comput. Ind. Eng. 70, 1\u201310 (2014). doi: 10.1016\/j.cie.2014.01.003","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9444_CR10","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.: The dynamic berth allocation problem for a container port. Transp. Res. B Methodol. 35(4), 401\u2013407 (2001)","journal-title":"Transp. Res. B Methodol."},{"key":"9444_CR11","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.: Biased random key genetic algorithm for the tactical berth allocation problem. Appl. Soft Comput. 22, 60\u201376 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"9444_CR12","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1016\/j.engappai.2012.06.001","volume":"25","author":"E Lalla-Ruiz","year":"2012","unstructured":"Lalla-Ruiz, E., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Eng. Appl. Artif. Intell. 25(6), 1132\u20131141 (2012)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9444_CR13","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.: Towards a matheuristic approach for the berth allocation problem. Lect. Notes Comput. Sci 8426, 218\u2013222 (2014)","journal-title":"Lect. Notes Comput. Sci"},{"key":"9444_CR14","doi-asserted-by":"crossref","unstructured":"Li, B., Li, W.F., Vo\u00df, S.: Modeling container terminal scheduling systems as hybrid flow shops with blocking based on attributes. In: S. Vo\u00df, J. Pahl, S. Schwarze (eds.) , pp. 413\u2013434. Physica, Heidelberg (2009)","DOI":"10.1007\/978-3-7908-2362-2_21"},{"key":"9444_CR15","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics - Hybridizing Metaheuristics and Mathematical Programming. Ann. Inf. Syst., vol. 10. Springer, Berlin (2010)","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"9444_CR16","volume-title":"Seaside Operations Planning in Container Terminals. Contributions to Management Science","author":"F Meisel","year":"2010","unstructured":"Meisel, F.: Seaside Operations Planning in Container Terminals. Contributions to Management Science. Physica, Heidelberg (2010)"},{"issue":"1","key":"9444_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1057\/palgrave.mel.9100148","volume":"8","author":"T Notteboom","year":"2006","unstructured":"Notteboom, T.: The time factor in liner shipping services. Marit. Econ. Logist. 8(1), 19\u201339 (2006)","journal-title":"Marit. Econ. Logist."},{"issue":"5","key":"9444_CR18","doi-asserted-by":"crossref","first-page":"5499","DOI":"10.1016\/j.eswa.2011.11.072","volume":"39","author":"RM Oliveira de","year":"2012","unstructured":"de Oliveira, R.M., Mauri, G.R., Lorena, L.A.N.: Clustering search for the berth allocation problem. Expert Syst. Appl. 39 (5), 5499\u20135505 (2012). doi: 10.1016\/j.eswa.2011.11.072","journal-title":"Expert Syst. Appl."},{"issue":"1-4","key":"9444_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00170-013-5263-8","volume":"70","author":"J Pei","year":"2014","unstructured":"Pei, J., Liu, X., Pardalos, P., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70 (1-4), 335\u2013348 (2014). doi: 10.1007\/s00170-013-5263-8","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9444_CR20","unstructured":"In: Resende, M., Pardalos, P. (eds.) : Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"9444_CR21","doi-asserted-by":"crossref","unstructured":"Rodriguez-Molins, M., Ingolotti, L., Barber, F., Salido, M., Sierra, M., Puente, J.: A genetic algorithm for robust berth allocation and quay crane assignment. Prog. Artif. Intell., 1\u201316 (2014). doi: 10.1007\/s13748-014-0056-3","DOI":"10.1007\/s13748-014-0056-3"},{"issue":"3","key":"9444_CR22","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control. Cybern. 35(3), 551\u2013578 (2006) http:\/\/eudml.org\/doc\/ 209435","journal-title":"Control. Cybern."},{"key":"9444_CR23","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.: Container terminal operations and operations research \u2013 a classification and literature review. OR Spectrum 26, 3\u201349 (2004). doi: 10.1007\/s00291-003-0157-z","journal-title":"OR Spectrum"},{"key":"9444_CR24","doi-asserted-by":"crossref","unstructured":"Taillard, E., Vo\u00df, S.: POPMUSIC \u2013 partial optimization metaheuristic under special intensification conditions. In: C. Ribeiro, P. Hansen (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Kluwer, Boston (2002), doi: 10.1007\/978-1-4615-1507-4_27","DOI":"10.1007\/978-1-4615-1507-4_27"},{"issue":"4","key":"9444_CR25","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"CJ Ting","year":"2014","unstructured":"Ting, C.J., Wu, K.C., Chou, H.: Particle swarm optimization algorithm for the berth allocation problem. Expert Syst. Appl. 41(4), 1543\u20131550 (2014). doi: 10.1016\/j.eswa.2013.08.051","journal-title":"Expert Syst. Appl."},{"key":"9444_CR26","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.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. E 54, 14\u201331 (2013). doi: 10.1016\/j.tre.2013.03.003","journal-title":"Transp. Res. E"},{"key":"9444_CR27","doi-asserted-by":"crossref","unstructured":"Verstichel, J., Berghe, G.: A late acceptance algorithm for the lock scheduling problem. In: S. Vo\u00df, J. Pahl, S. Schwarze (eds.) Management, Logistik, pp. 457\u2013478. Physica, Heidelberg (2009)","DOI":"10.1007\/978-3-7908-2362-2_23"},{"key":"9444_CR28","doi-asserted-by":"crossref","unstructured":"Xiao, L., Hu, Z.H.: Berth allocation problem with quay crane assignment for container terminals based on rolling-horizon strategy. Math. Probl. Eng. 2014 (2014). doi: 10.1155\/2014\/845752 . Article ID 845752, 11 pages","DOI":"10.1155\/2014\/845752"},{"key":"9444_CR29","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/978-3-642-40627-0_64","volume":"8124","author":"S Zampelli","year":"2013","unstructured":"Zampelli, S., Vergados, Y., Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. Lect. Notes Comput. Sci 8124, 880\u2013896 (2013). doi: 10.1007\/978-3-642-40627-0_64","journal-title":"Lect. Notes Comput. Sci"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9444-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-014-9444-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9444-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T02:47:22Z","timestamp":1566182842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-014-9444-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,31]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9444"],"URL":"https:\/\/doi.org\/10.1007\/s10472-014-9444-4","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,31]]}}}