{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:10:34Z","timestamp":1760472634216,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008970"},{"type":"electronic","value":"9783030008987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00898-7_12","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T12:27:11Z","timestamp":1537360031000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Crane Intensity and Block Stowage Strategies in Stowage Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7255-004X","authenticated-orcid":false,"given":"Dario","family":"Pacino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.trpro.2015.09.026","volume":"10","author":"D Ambrosino","year":"2015","unstructured":"Ambrosino, D., Paolucci, M., Sciomachen, A.: A MIP heuristic for multi port stowage planning. Transp. Res. Procedia 10, 725\u2013734 (2015)","journal-title":"Transp. Res. Procedia"},{"issue":"7","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s00500-015-1879-y","volume":"21","author":"D Ambrosino","year":"2017","unstructured":"Ambrosino, D., Paolucci, M., Sciomachen, A.: Computational evaluation of a MIP model for multi-port stowage planning problems. Soft Comput. 21(7), 1753\u20131763 (2017)","journal-title":"Soft Comput."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1018956823693","volume":"76","author":"M Avriel","year":"1998","unstructured":"Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res. 76, 55\u201371 (1998)","journal-title":"Ann. Oper. Res."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.tre.2016.10.005","volume":"97","author":"J Christensen","year":"2017","unstructured":"Christensen, J., Pacino, D.: A matheuristic for the Cargo Mix Problem with Block Stowage. Transp. Res. Part E Logist. Transp. Rev. 97, 151\u2013171 (2017)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.ejor.2015.03.044","volume":"246","author":"D Ding","year":"2015","unstructured":"Ding, D., Chou, M.C.: Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts. Eur. J. Oper. Res. 246(1), 242\u2013249 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-24264-9_22","volume-title":"Computational Logistics","author":"D Pacino","year":"2011","unstructured":"Pacino, D., Delgado, A., Jensen, R.M., Bebbington, T.: Fast generation of near-optimal plans for eco-efficient stowage of large container vessels. In: B\u00f6se, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Vo\u00df, S. (eds.) ICCL 2011. LNCS, vol. 6971, pp. 286\u2013301. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24264-9_22"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-33587-7_2","volume-title":"Computational Logistics","author":"D Pacino","year":"2012","unstructured":"Pacino, D., Delgado, A., Jensen, R.M., Bebbington, T.: An accurate model for seaworthy container vessel stowage planning with ballast tanks. In: Hu, H., Shi, X., Stahlbock, R., Vo\u00df, S. (eds.) ICCL 2012. LNCS, vol. 7555, pp. 17\u201332. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33587-7_2"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tre.2016.07.011","volume":"94","author":"F Parre\u00f1o","year":"2016","unstructured":"Parre\u00f1o, F., Pacino, D., Alvarez-Valdes, R.: A GRASP algorithm for the container stowage slot planning problem. Transp. Res. Part E Logist. Transp. Rev. 94, 141\u2013157 (2016)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer, Boston (2010). \n                      https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1287\/trsc.2017.0795","volume":"52","author":"R. Roberti","year":"2018","unstructured":"Roberti, R., Pacino, D.: A decomposition method for finding optimal container stowage plans (2018, accepted manuscript to appear in Transportation Science)","journal-title":"Transportation Science"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.dam.2014.01.005","volume":"169","author":"K Tierney","year":"2014","unstructured":"Tierney, K., Pacino, D., Jensen, R.M.: On the complexity of container stowage planning problems. Discrete Appl. Math. 169, 225\u2013230 (2014)","journal-title":"Discrete Appl. Math."},{"key":"12_CR13","unstructured":"UNCTAD: Review of maritime transport 2017 (2017)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00898-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:45:15Z","timestamp":1558327515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00898-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008970","9783030008987"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00898-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}